Advertisement

Exact and Heuristic Solution Approaches for a Flexible Job Shop Scheduling Problem Incorporating Machine Operator Restrictions

  • David MüllerEmail author
  • Dominik Kress
  • Jenny Nossack
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

This paper addresses a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications. The objective is to minimize the makespan. We present a mixed-integer program and sketch exact and heuristic solution approaches that are based on a decomposition of the problem into a vehicle routing problem and a machine operator assignment problem. The solution methods are analyzed in computational tests. For details, we refer to our full paper.

Keywords

Scheduling Flexible job shop Decomposition Priority rules 

Notes

Acknowledgements

This work has been supported by the European Union and the state North Rhine-Westphalia through the European Fund for Regional Development (EFRD). It has been conducted as part of the project “EKPLO: Echtzeitnahes kollaboratives Planen und Optimieren” (EFRE-0800463).

References

  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., Soroush, H.M.: The significance of reducing setup times/setup costs. Eur. J. Oper. Res. 187(3), 978–984 (2008)zbMATHCrossRefGoogle Scholar
  3. 3.
    Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)CrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    Błazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007)zbMATHGoogle Scholar
  6. 6.
    Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    De Bruecker, P., Van den Bergh, J., Beliën, J., Demeulemeester, E.: Workforce planning incorporating skills: state of the art. Eur. J. Oper. Res. 243(1), 1–16 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Giffler, B., Thompson, G.L.: Algorithms for solving production-scheduling problems. Oper. Res. 8(4), 487–503 (1960)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spect. 15(4), 205–215 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Kress, D., Müller, D., Nossack, J.: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times. OR Spect. 41(1), 179–217 (2019)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int. J. Prod. Res. 50(15), 4255–4270 (2012)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Management Information ScienceUniversity of SiegenSiegenGermany
  2. 2.Center for Advanced Studies in ManagementHHL LeipzigLeipzigGermany

Personalised recommendations