Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor

  • Dominik KressEmail author
  • Maksim Barketau
  • Erwin Pesch
  • David Müller
Conference paper
Part of the Operations Research Proceedings book series (ORP)


We address the problem of sequencing n jobs that are partitioned into F families on a single processor. A setup operation is needed at the beginning of the schedule and whenever a job of one family is succeeded by a job of another family. These setup operations are assumed to not require time but are associated with a fixed setup cost which is identical for all setup operations. Jobs must be completed no later than by a given deadline. The objective is to schedule all jobs such that the total setup cost is minimized. This objective is identical to minimizing the number of setup operations. We provide a sketch of the proof of the problem’s strong NP-hardness as well as some properties of optimal solutions and an \(O(n \log n + nF)\) algorithm that approximates the cost of an optimal schedule by a factor of F. For details, we refer to our full paper.


Batch scheduling Setup cost Approximation algorithm 


  1. 1.
    Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2), 345–378 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)CrossRefGoogle Scholar
  3. 3.
    Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007)zbMATHGoogle Scholar
  5. 5.
    Bruno, J., Downey, P.: Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput. 7(4), 393–404 (1978)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Cheng, T.C.E., Ng, C.T., Yuan, J.J.: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. J. Sched. 6(5), 483–490 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, New York (1979)zbMATHGoogle Scholar
  8. 8.
    Kress, D., Barketau, M., Pesch, E.: Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. J. Sched. 21(6), 595–606 (2018)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Lu, L.F., Yuan, J.J.: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. Eur. J. Oper. Res. 177(2), 1302–1309 (2007)zbMATHCrossRefGoogle Scholar
  10. 10.
    Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228–249 (2000)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Dominik Kress
    • 1
    Email author
  • Maksim Barketau
    • 2
  • Erwin Pesch
    • 1
    • 3
  • David Müller
    • 1
  1. 1.Management Information ScienceUniversity of SiegenSiegenGermany
  2. 2.United Institute of Informatics ProblemsNAS of BelarusMinskBelarus
  3. 3.Center for Advanced Studies in ManagementHHL LeipzigLeipzigGermany

Personalised recommendations