Non-overlapping Sequence-Dependent Setup Scheduling with Dedicated Tasks

  • Marek VlkEmail author
  • Antonin Novak
  • Zdenek Hanzalek
  • Arnaud Malapert
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1162)


The paper deals with a parallel machines scheduling problem with dedicated tasks with sequence-dependent setup times that are subject to the non-overlapping constraint. This problem emerges in the productions where only one machine setter is available on the shop floor. We consider that setups are performed by a single person who cannot serve more than one machine at the same moment, i.e., the setups must not overlap in time. We show that the problem remains \(\mathcal {NP}\)-hard under the fixed sequence of tasks on each machine. To solve the problem, we propose an Integer Linear Programming formulation, five Constraint Programming models, and a hybrid heuristic algorithm LOFAS that leverages the strength of Integer Linear Programming for the Traveling Salesperson Problem (TSP) and the efficiency of Constraint Programming at sequencing problems minimizing makespan. Furthermore, we investigate the impact of the TSP solution quality on the overall objective value. The results show that LOFAS with a heuristic TSP solver achieves on average 10.5% worse objective values but it scales up to 5000 tasks with 5 machines.


Constrained setup times Constraint Programming Hybrid heuristic 



We would like to thank Philippe Laborie for his help with the design of CP4 model.


  1. 1.
    Google’s or-tools. Accessed 22 May 2019
  2. 2.
    Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149–156 (1991)CrossRefGoogle Scholar
  4. 4.
    Balas, E.: Project scheduling with resource constraints. Technical report, Carnegie-Mellon University, Pittsburgh, Pa, Management Sciences Research Group (1968)Google Scholar
  5. 5.
    Chen, D., Luh, P.B., Thakur, L.S., Moreno Jr., J.: Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots. IIE Trans. 35(10), 973–985 (2003)CrossRefGoogle Scholar
  6. 6.
    Gurobi: Constraints. (2019). Accessed 12 June 2019
  7. 7.
    Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  8. 8.
    Laborie, P., Rogerie, J., Shaw, P., Vilim, P.: Reasoning with conditional time-intervals. Part II: an algebraical model for resources. In: FLAIRS Conference, pp. 201–206 (2009)Google Scholar
  9. 9.
    Laborie, P., Rogerie, J., Shaw, P., Vilim, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210–250 (2018)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lasserre, J.B., Queyranne, M.: Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Proceedings of the 2nd IPCO (Integer Programming and Combinatorial Optimization) Conference, pp. 136–149 (1992)Google Scholar
  11. 11.
    Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100(3), 464–474 (1997)CrossRefGoogle Scholar
  12. 12.
    Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399–419. Springer, Boston (2010). Scholar
  13. 13.
    Ruiz, R., Andres-Romano, C.: Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 57(5–8), 777–794 (2011)CrossRefGoogle Scholar
  14. 14.
    Tempelmeier, H., Buschkuhl, L.: Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource. Int. J. Prod. Econ. 113(1), 401–412 (2008)CrossRefGoogle Scholar
  15. 15.
    Vallada, E., Ruiz, R.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3), 612–622 (2011)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Vilim, P., Bartak, R., Cepek, O.: Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10(4), 403–425 (2005). Scholar
  17. 17.
    Vlk., M., Novak., A., Hanzalek., Z.: Makespan minimization with sequence-dependent non-overlapping setups. In: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, pp. 91–101. INSTICC, SciTePress (2019).
  18. 18.
    Wikum, E.D., Llewellyn, D.C., Nemhauser, G.L.: One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16(2), 87–99 (1994). Scholar
  19. 19.
    Zhao, X., Luh, P.B., Wang, J.: Surrogate gradient algorithm for lagrangian relaxation. J. Optim. Theory Appl. 100(3), 699–712 (1999)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Marek Vlk
    • 1
    • 2
    Email author
  • Antonin Novak
    • 2
    • 3
  • Zdenek Hanzalek
    • 2
  • Arnaud Malapert
    • 4
  1. 1.Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic
  2. 2.Czech Institute of Informatics, Robotics, and CyberneticsCzech Technical University in PraguePragueCzech Republic
  3. 3.Department of Control Engineering, Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic
  4. 4.Université Côte d’Azur, I3S, CNRSNiceFrance

Personalised recommendations