Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2018 pp 481–488Cite as

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

  • Conference paper
  • First Online:

  • 1018 Accesses

Part of the book series: Operations Research Proceedings ((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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2), 345–378 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allahverdi, A., Soroush, H.M.: The significance of reducing setup times/setup costs. Eur. J. Oper. Res. 187(3), 978–984 (2008)

    Article  MATH  Google Scholar 

  3. Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  5. Błazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Berlin (2007)

    MATH  Google Scholar 

  6. Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Giffler, B., Thompson, G.L.: Algorithms for solving production-scheduling problems. Oper. Res. 8(4), 487–503 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

Download references

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).

Author information

Authors and Affiliations

  1. Management Information Science, University of Siegen, Siegen, Germany

    David Müller & Dominik Kress

  2. Center for Advanced Studies in Management, HHL Leipzig, Leipzig, Germany

    Jenny Nossack

Authors
  1. David Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominik Kress
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jenny Nossack
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Müller .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Université Libre de Bruxelles, Brussels, Belgium

    Bernard Fortz

  2. Department of Computer Science, Université Libre de Bruxelles, Brussels, Belgium

    Martine Labbé

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Müller, D., Kress, D., Nossack, J. (2019). Exact and Heuristic Solution Approaches for a Flexible Job Shop Scheduling Problem Incorporating Machine Operator Restrictions. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_60

Download citation

Publish with us

Policies and ethics

Search

Navigation