Flow-shop scheduling with a learning effect
Flow-shop scheduling with a learning effect
Publication information
Publisher
Basingstoke: Taylor & Francis
Subjects
More information
Scope and Contents
Contents
The paper is devoted to some flow-shop scheduling problems with a learning effect. The objective is to minimize one of the two regular performance criteria, namely, makespan and total flowtime. A heuristic algorithm with worst-case bound m for each criteria is given, where m is the number of machines. Furthermore, a polynomial algorithm is proposed...
Alternative Titles
Full title
Flow-shop scheduling with a learning effect
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_231334704
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_231334704
Other Identifiers
ISSN
0160-5682
E-ISSN
1476-9360
DOI
10.1057/palgrave.jors.2601856
