| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7541560 | Computers & Industrial Engineering | 2018 | 6 Pages |
Abstract
Machine scheduling with raw material constraints has a great practical potential, as it is solved by ad hoc methods in practice in several manufacturing and logistic environments. In this paper we propose an exact method for solving this problem with the maximum lateness objective based on mathematical programming, our main contribution being a set of new cutting planes that can be used to accelerate a MIP solver. We report on computational results on a wide set of instances.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Péter Györgyi, Tamás Kis,