A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes

  • Sebastian Kosch
  • J. Christopher Beck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8451)


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.


Mixed Integer Programming Constraint Programming Master Problem Global Constraint Mixed Integer Programming Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hooker, J.: A hybrid method for planning and scheduling. Constraints 10, 385–401 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Beck, J.C., Feng, T.K., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS Journal on Computing 23(1), 1–14 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Tran, T.T., Beck, J.C.: Logic-based benders decomposition for alternative resource scheduling with sequence-dependent setups. In: Proceedings of the Twentieth European Conference on Artificial Intelligence (ECAI 2012), pp. 774–779 (2012)Google Scholar
  4. 4.
    Malapert, A., Guéret, C., Rousseau, L.M.: A constraint programming approach for a batch processing problem with non-identical job sizes. European Journal of Operational Research 221, 533–545 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.: Solving RCPSP/max by lazy clause generation. Journal of Scheduling 16(3), 273–289 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5(1-2), 119–139 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers (2001)Google Scholar
  8. 8.
    Vilím, P.: Edge finding filtering algorithm for discrete cumulative resources in O(kn log n). In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 802–816. Springer, Heidelberg (2009)Google Scholar
  9. 9.
    Freuder, E.C.: In pursuit of the holy grail. Constraints 2, 57–61 (1997)CrossRefGoogle Scholar
  10. 10.
    Heinz, S., Ku, W.-Y., Beck, J.C.: Recent improvements using constraint integer programming for resource allocation and scheduling. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 12–27. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    Daste, D., Gueret, C., Lahlou, C.: A branch-and-price algorithm to minimize the maximum lateness on a batch processing machine. In: Proceedings of the 11th International Workshop on Project Management and Scheduling (PMS), Istanbul, Turkey, pp. 64–69 (2008)Google Scholar
  12. 12.
    Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764–775 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Grossmann, I.E.: Mixed-integer optimization techniques for the design and scheduling of batch processes. Technical Report Paper 203, Carnegie Mellon University Engineering Design Research Center and Department of Chemical Engineering (1992)Google Scholar
  14. 14.
    Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling 1(1), 31–54 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall (2003)Google Scholar
  16. 16.
    Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  17. 17.
    Azizoglu, M., Webster, S.: Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research 38(10), 2173–2184 (2000)CrossRefzbMATHGoogle Scholar
  18. 18.
    Dupont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure. Computers & Operations Research 29(7), 807–819 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Sabouni, M.Y., Jolai, F.: Optimal methods for batch processing problem with makespan and maximum lateness objectives. Applied Mathematical Modelling 34(2), 314–324 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Kashan, A.H., Karimi, B., Ghomi, S.M.T.F.: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes. Theoretical Computer Science 410(27-29), 2754–2758 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Ozturk, O., Espinouse, M.L., Mascolo, M.D., Gouin, A.: Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates. International Journal of Production Research 50(20), 6022–6035 (2012)CrossRefGoogle Scholar
  22. 22.
    IBM ILOG: User’s manual for cplex (2013)Google Scholar
  23. 23.
    Ilog, I.: Cplex optimization suite 12.5 (2013)Google Scholar
  24. 24.
    Choco Team: Choco: An open source java constraint programming library. version 2.1.5 (2013)Google Scholar
  25. 25.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Sebastian Kosch
    • 1
  • J. Christopher Beck
    • 1
  1. 1.Department of Mechanical & Industrial EngineeringUniversity of TorontoTorontoCanada

Personalised recommendations