Skip to main content
SpringerLink
Log in

The Problem of Tasks Scheduling with Due Dates in a Flexible Multi-machine Production Cell

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

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

Included in the following conference series:

  • 1118 Accesses

Abstract

In the paper we consider an NP-hard problem of tasks scheduling with due dates and penalties for the delay in a flexible production cell. Each task should be assigned to one of the cell’s machines and the order of their execution on machines should be determined. The sum of penalties for tardiness of tasks execution should be minimized. We propose to use the tabu search algorithm to solve the problem. Neighborhoods are generated by moves based on changing the order of tasks on the machine and changing the machine on which the task will be performed. We prove properties of moves that significantly accelerate the search of the neighborhoods and shorten the time of the algorithm execution and in result significantly improves the efficiency of the algorithm compared to the version that does not use these properties.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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. Alidaee, B., Rosa, D.: Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput. Oper. Res. 24(8), 775–788 (1997)

    Article  MathSciNet  Google Scholar 

  2. Bożejko, W., Grabowski, J., Wodecki, M.: Block approach tabu search algorithm for single machine total weighted tardiness problem. Comput. Ind. Eng. 50(1–2), 1–14 (2006)

    Article  Google Scholar 

  3. Bożejko, W., Uchroński, M., Wodecki, M.: Blocks for two-machines total weighted tardiness flow shop scheduling problem. Bull. Pol. Acad. Sci. Tech. Sci. 68(1), 31–41 (2020)

    Google Scholar 

  4. Bulfin, R.L., Hallah, R.: Minimizing the weighted number of tardy tasks on two-machine flow shop. Comput. Oper. Res. 30, 1887–1900 (2003)

    Article  MathSciNet  Google Scholar 

  5. Karabulut, K.: A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput. Ind. Eng. 98, 300–307 (2016)

    Article  Google Scholar 

  6. Kayvanfar, V., Komaki, G.H.M., Aalaei, A., Zandieh, M.: Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput. Oper. Res. 41, 31–43 (2014)

    Article  MathSciNet  Google Scholar 

  7. Lenstra, J.K., Rinnooy Kan, A.G.H., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)

    Google Scholar 

  8. Liaw, C.-F., Lin, Y.-K., Cheng, C.-Y., Chen, M.: Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput. Oper. Res. 30(12), 1777–1789 (2003)

    Article  MathSciNet  Google Scholar 

  9. Liu, C.: A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Math. Probl. Eng. (2013). ID 537127

    Google Scholar 

  10. Park, J.M., Choi, B.C., Min, Y., Kim, K.M.: Two-machine ordered flow shop scheduling with generalized due dates. Asia-Pac. J. Oper. Res. 37(01), 1950032 (2020)

    Article  MathSciNet  Google Scholar 

  11. Ojstersek, R., Tang, M., Buchmeister, B.: Due date optimization in multi-objective scheduling of flexible job shop production. Adv. Prod. Eng. Manag. 15(4), 481–492 (2020)

    Google Scholar 

  12. Potts, C.N., Van Wassenhove, L.N.: A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1, 177–181 (1982)

    Article  Google Scholar 

  13. Toncovicha, A., Rossit, D., Frutos, M., Rossit, D.G., Daniel, A.: Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure. Int. J. Ind. Eng. Comput. 10, 1–16 (2019)

    Google Scholar 

  14. Wodecki, M.: A block branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. Adv. Manuf. Technol. 37, 996–1004 (2008)

    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

  2. Witelon State University of Applied Science in Legnica, Sejmowa 5A, 59-220, Legnica, Poland

    Piotr Nadybski

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

    Paweł Rajba

  4. 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. Piotr Nadybski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Rajba
    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., Nadybski, P., Rajba, P., Wodecki, M. (2021). The Problem of Tasks Scheduling with Due Dates in a Flexible Multi-machine Production Cell. In: Paszynski, M., Kranzlmüller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M. (eds) Computational Science – ICCS 2021. ICCS 2021. Lecture Notes in Computer Science(), vol 12745. Springer, Cham. https://doi.org/10.1007/978-3-030-77970-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-77970-2_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-77969-6

  • Online ISBN: 978-3-030-77970-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation