Log in to save to my catalogue

Iterative search method for total flowtime minimization no-wait flowshop problem

Iterative search method for total flowtime minimization no-wait flowshop problem

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2919492926

Iterative search method for total flowtime minimization no-wait flowshop problem

About this item

Full title

Iterative search method for total flowtime minimization no-wait flowshop problem

Author / Creator

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

International journal of machine learning and cybernetics, 2015-10, Vol.6 (5), p.747-761

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

In this paper, the no-wait flowshop problem with total flowtime minimization is considered. In order to fast evaluate a new solution generated in the searching process in an algorithm, the objective increment properties of fundamental operators are analyzed on the basis of the distance of adjacent jobs in a sequence. An iterative search method is p...

Alternative Titles

Full title

Iterative search method for total flowtime minimization no-wait flowshop problem

Authors, Artists and Contributors

Author / Creator

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2919492926

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2919492926

Other Identifiers

ISSN

1868-8071

E-ISSN

1868-808X

DOI

10.1007/s13042-014-0312-7

How to access this item