Approximation algorithms for the three-machine proportionate mixed shop scheduling
Approximation algorithms for the three-machine proportionate mixed shop scheduling
About this item
Full title
Author / Creator
Liu, Longcheng , Chen, Yong , Dong, Jianming , Goebel, Randy , Lin, Guohui , Luo, Yue , Ni, Guanqun , Su, Bing and Zhang, An
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as \(M3 \mid prpt...
Alternative Titles
Full title
Approximation algorithms for the three-machine proportionate mixed shop scheduling
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2108715619
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2108715619
Other Identifiers
E-ISSN
2331-8422
