Parallel-batch machine problems arise in numerous manufacturing settings from semiconductor manufacturing to printing. They have recently been addressed in constraint programming (CP) via the combination of the novel sequenceEDD global constraint with the existing pack constraint to form the current state-of-the-art approach. In this paper, we present a detailed analysis of the problem and derivation of a number of properties that are exploited in a novel mixed integer programming (MIP) model for the problem. Our empirical results demonstrate that the new model is able to outperform the CP model across a range of standard benchmark problems. Further investigation shows that the new MIP formulation improves on the existing formulation primarily by producing a much smaller model and enabling high quality primal solutions to be found very quickly. © 2014 Springer International Publishing.
CITATION STYLE
Kosch, S., & Beck, J. C. (2014). A new MIP model for parallel-batch scheduling with non-identical job sizes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8451 LNCS, pp. 55–70). Springer Verlag. https://doi.org/10.1007/978-3-319-07046-9_5
Mendeley helps you to discover research relevant for your work.