A Matheuristic Based on Column Generation for Parallel Machine Scheduling with Sequence Dependent Setup Times

  • Filipe AlvelosEmail author
  • Manuel Lopes
  • Henrique Lopes
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 682)


In this paper we propose a heuristic approach based on column generation (CG) and a general purpose integer programming (GPIP) solver to address a scheduling problem. The problem consists in scheduling independent jobs with given processing times on unrelated parallel machines with sequence-dependent setup times. The objective is to minimize the total weighted tardiness. The proposed matheuristic (MH) takes advantage of the efficiency of CG to define a (restricted) search space which is explored by a GPIP solver. In different iterations, different additional constraints are introduced in CG, allowing the definition of several (restricted) search spaces to be explored by the GPIP solver. Computational results show that the proposed MH can be used to tackle very large instances (e.g. 100 machines and 400 jobs) obtaining better solutions in less time than a state-of-the-art branch-and-price algorithm from the literature.



This work is financed by Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within projects “SearchCol: Metaheuristic search by column generation” (PTDC/EIAEIA/100645/2008) and PEst-OE/EEI/UI0319/2014.


  1. 1.
    Allahverdi, A., Soroush, H.M.: The significance of reducing setup times/setup costs. Eur. J. Oper. Res. 187(3), 978–984 (2008)CrossRefGoogle Scholar
  2. 2.
    Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)CrossRefGoogle Scholar
  3. 3.
    Alvelos, F., Sousa, A., Santos, D.: Combining column generation and metaheuristics. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 285–334. Springer, Berlin/Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(2), 287–326 (1979)CrossRefGoogle Scholar
  5. 5.
    ILOG: IBM ILOG CPLEX Optimization Studio V12.4 (2012)Google Scholar
  6. 6.
    Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343–362 (1977)CrossRefGoogle Scholar
  7. 7.
    Lopes, M.J.P., de Carvalho, J.M.V.: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur. J. Oper. Res. 176(3), 1508–1527 (2007)CrossRefGoogle Scholar
  8. 8.
    Lopes, M., Alvelos, F., Lopes, H.: Improving branch-and-price for parallel machine scheduling. Lect. Notes Comput. Sci. 8580, 290–300 (2014)CrossRefGoogle Scholar
  9. 9.
    Mokotoff, E.: Parallel machine scheduling problems: a survey. Asia-Pacific J. Oper. Res. 18(2), 193–243 (2001)Google Scholar
  10. 10.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Centro Algoritmi and Departamento de Produção e SistemasUniversidade do MinhoBragaPortugal
  2. 2.CIDEM-ISEP, School of EngineeringPolytechnic of PortoPortoPortugal
  3. 3.Centro AlgoritmiUniversidade do MinhoBragaPortugal

Personalised recommendations