Reentrant flow shop with identical jobs and makespan criterion
Reentrant flow shop with identical jobs and makespan criterion
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
The article focuses on the problem of a reentrant flow shop with identical jobs and makespan minimisation objective. After presenting an optimal integer programming formulation for the problem, we consider the case of unit processing times. We correct two results published a few decades ago regarding two greedy heuristic algorithms. In some cases,...
Alternative Titles
Full title
Reentrant flow shop with identical jobs and makespan criterion
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2760022451
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2760022451
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2021.1957505
