Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
About this item
Full title
Author / Creator
Publisher
London: Taylor & Francis
Journal title
Language
English
Formats
Publication information
Publisher
London: Taylor & Francis
Subjects
More information
Scope and Contents
Contents
This paper addresses the m-machine no-wait flowshop problem where the set-up time of a job is separated from its processing time. The performance measures considered are the total flowtime and makespan. The scheduling problem for makespan reduces to the travelling salesman problem (TSP), and the scheduling problem for total flowtime reduces to the...
Alternative Titles
Full title
Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_231261105
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_231261105
Other Identifiers
ISSN
0160-5682
E-ISSN
1476-9360
DOI
10.1057/palgrave.jors.2601695
