Efficient mixed integer programming models for family scheduling problems

Artikel

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.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: Operations Research Perspectives ; ISSN: 2214-7160 ; Volume: 4 ; Year: 2017 ; Pages: 49-55 ; Amsterdam: Elsevier

Classification and Topics

• Classification: Wirtschaft
• Subject: Family scheduling ; Sequence independent setup ; Total weighted completion time ; Maximum lateness

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Lin, Meng-Ye ; Kuo, Yarlin
• Event: Veröffentlichung
• (who): Elsevier
• (where): Amsterdam
• (when): 2017

Further information

• DOI: doi:10.1016/j.orp.2017.03.001
• Handle: http://hdl.handle.net/10419/178280
• Last update: 10.03.2025, 11:44 AM CET