Efficient mixed integer programming models for family scheduling problems
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2017-01-01
|
| Series: | Operations Research Perspectives |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2214716016301385 |