Mathematical model for cyclic scheduling with work-in-process minimization
Résumé
This paper is part of an original approach of mathematical modeling for solving cyclic scheduling problems. More precisely, we consider the cyclic job shop. This kind of manufacturing systems is well fitted to medium and large production demands. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we chose the exact techniques, and we focus on the mathematical programming approach. We proposed, in an earlier study, a mathematical programming model for cyclic scheduling with Work-In-Process minimization. We propose here several cutting techniques to improve the practical performances of the model resolution. Some numerical experiments are used to assess the relevance of our propositions. We made a comparison between the original mathematical model and the one endowed by the proposed cuts. This comparison is based on a set of benchmarks generated for this reason. In addition, we make another comparison based on some examples from the literature.