Skip to main content
SpringerLink
Log in

A Job Shop Scheduling Problem with Due Dates Under Conditions of Uncertainty

  • Conference paper
  • First Online:
Computational Science – ICCS 2021 (ICCS 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12742))

Included in the following conference series:

Abstract

In the work we consider a job shop problem with due dates under conditions of uncertainty. Uncertainty is considered for operation execution times and job completion dates. It is modeled by normal and Erlang random variables. We present algorithms whose constructions are based on the tabu search method. Due to the application of the probabilistic model, it was possible to obtain solutions more resistant to data disturbances than in the classical approach.

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

Access this chapter

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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

Institutional subscriptions

References

  1. Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11(4), 253–262 (2008). https://doi.org/10.1007/s10951-008-0067-7

    Article  MathSciNet  MATH  Google Scholar 

  2. Bożejko, W., Rajba, P., Wodecki, M.: Stable scheduling of single machine with probabilistic parameters. Bull. Pol. Acad. Sci. Tech. Sci. 65(2), 219–231 (2017)

    Google Scholar 

  3. Bożejko, W., Rajba, P., Wodecki, M.: Robustness of the uncertain single machine total weighted tardiness problem with elimination criteria applied. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) DepCoS-RELCOMEX 2018. AISC, vol. 761, pp. 94–103. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91446-6_10

    Chapter  Google Scholar 

  4. Grabowski J., Wodecki M.: A very fast tabu search algorithm for job shop problem. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution, pp. 117–144. Kluwer Academic Publishers (2005)

    Google Scholar 

  5. Kim, J.G., Jun, H.B., Bang, J.Y., Shin, J.H., Choi, S.H.: Minimizing tardiness penalty costs in job shop scheduling under maximum allowable tardiness. Processes 8(11), 1398 (2020)

    Article  Google Scholar 

  6. OR-Library. http://www.brunel.ac.uk/~mastjjb/jeb/info.html

  7. Rajba, P., Wodecki, M.: Sampling method for the flow shop with uncertain parameters. In: Saeed, K., Homenda, W., Chaki, R. (eds.) CISIM 2017. LNCS, vol. 10244, pp. 580–591. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59105-6_50

    Chapter  Google Scholar 

  8. Sharma, P., Jain, A.: A review on job shop scheduling with setup times. J. Eng. Manuf. 230(3), 517–533 (2016)

    Article  Google Scholar 

  9. Shoval, S., Efatmaneshnik, M.: A probabilistic approach to the Stochastic Job-Shop Scheduling problem. Procedia Manuf. 21, 533–540 (2018)

    Article  Google Scholar 

Download references

Acknowledgments

The paper was partially supported by the National Science Centre of Poland, grant OPUS no. 2017/25/B/ST7/02181.

Author information

Authors and Affiliations

  1. Department of Automatics, Mechatronics and Control Systems, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko & Mariusz Uchroński

  2. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Paweł Rajba

  3. Department of Telecommunications and Teleinformatics, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Mieczysław Wodecki

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Rajba
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mariusz Uchroński
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

  1. AGH University of Science and Technology, Krakow, Poland

    Maciej Paszynski

  2. Ludwig-Maximilians-Universität München, Munich, Germany

    Dieter Kranzlmüller

  3. University of Amsterdam, Amsterdam, The Netherlands

    Valeria V. Krzhizhanovskaya

  4. University of Tennessee at Knoxville, Knoxville, TN, USA

    Jack J. Dongarra

  5. University of Amsterdam, Amsterdam, The Netherlands

    Peter M. A. Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bożejko, W., Rajba, P., Uchroński, M., Wodecki, M. (2021). A Job Shop Scheduling Problem with Due Dates Under Conditions of Uncertainty. In: Paszynski, M., Kranzlmüller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds) Computational Science – ICCS 2021. ICCS 2021. Lecture Notes in Computer Science(), vol 12742. Springer, Cham. https://doi.org/10.1007/978-3-030-77961-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-77961-0_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-77960-3

  • Online ISBN: 978-3-030-77961-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation