Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/178280 
Year of Publication: 
2017
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 4 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2017 [Pages:] 49-55
Publisher: 
Elsevier, Amsterdam
Abstract: 
This paper proposes several mixed integer programming models which incorporate optimal sequence properties into the models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum lateness, respectively. Experiment results indicate that there are remarkable improvements in computational efficiency when optimal sequence properties are included in the models. For the total weighted completion time problems, the best model solves all of the problems up to 30-jobs within 5 s, all 50-job problems within 4 min and about 1/3 of the 75-job to 100-job problems within 1 h. For maximum lateness problems, the best model solves almost all the problems up to 30-jobs within 11 min and around half of the 50-job to 100-job problems within 1 h.
Subjects: 
Family scheduling
Sequence independent setup
Total weighted completion time
Maximum lateness
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.