Scheduling parallel machines to minimize weighted flowtime with family set-up times
Scheduling parallel machines to minimize weighted flowtime with family set-up times
About this item
Full title
Author / Creator
Publisher
Taylor & Francis Group
Journal title
Language
English
Formats
Publication information
Publisher
Taylor & Francis Group
More information
Scope and Contents
Contents
We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range o...
Alternative Titles
Full title
Scheduling parallel machines to minimize weighted flowtime with family set-up times
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1080_0020754021000042959
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1080_0020754021000042959
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/0020754021000042959
