In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem. The new model requires fewer constraints than the original formulation and this often leads to shorter computation time of a MIP solver. Besides that, the new formulation is more flexible if the time windows for changeover tasks are given.
@article{arxiv.1408.5832,
title = {Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem},
author = {Pavel A. Borisovsky and Anton V. Eremeev and Josef Kallrath},
journal= {arXiv preprint arXiv:1408.5832},
year = {2014}
}
Comments
To appear in Proc. of VIII International School-Symposium "Analysis, Modelling, Management and Development of Economical Systems" (AMUR'2014). - Sevastopol, 2014