TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
About this item
Full title
Author / Creator
Publisher
Singapore: World Scientific Publishing Co. & Operational Research Society of Singapore
Journal title
Language
English
Formats
Publication information
Publisher
Singapore: World Scientific Publishing Co. & Operational Research Society of Singapore
Subjects
More information
Scope and Contents
Contents
The flow-shop minimum-length scheduling problem with n jobs processed on two machines is addressed where processing times are uncertain: only lower and upper bounds of the random processing times are given before scheduling, but their probability distributions are unknown. For such a problem, there may not exist a dominant schedule that remains opt...
Alternative Titles
Full title
TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1142_S0217595909002432
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1142_S0217595909002432
Other Identifiers
ISSN
0217-5959
E-ISSN
1793-7019,0217-5959
DOI
10.1142/S0217595909002432
