Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
We consider bicriteria flowshop scheduling problems with two machines to simultaneously minimize the makespan and the total completion time without any prioritization between the two objectives. An approximation relative to the optimal value of the problem with regard to each objective is adopted, even though a schedule with both objectives reachin...
Alternative Titles
Full title
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2924812670
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2924812670
Other Identifiers
ISSN
1094-6136
E-ISSN
1099-1425
DOI
10.1007/s10951-023-00781-x
