Skip to main content
SpringerLink
Log in

Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem

  • Conference paper
  • First Online:
16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021) (SOCO 2021)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1401))

  • 1003 Accesses

Abstract

This paper presents an algorithm based on the simulated annealing technique for the problem of scheduling tasks on one machine with the criterion of minimizing the sum of costs of tasks performed overdue. We propose to use, for the first time in simulated annealing, elimination criteria, the so-called blocks, allowing to not considered non-perspective solutions from the neighborhood. The use of blocks with the parallelization of the algorithm with the use of the MPI library allowed to improve the algorithm’s efficiency in the same number of steps. Additionally, we propose to extend the benchmark database with new large test instances for which the block properties are most fully presented.

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

  2. Grabowski, J., Wodecki, M.: A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31, 1891–1909 (2004)

    Article  MathSciNet  Google Scholar 

  3. Kirkpatrick, S., Gellat, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 26, 53–67 (1983)

    MathSciNet  Google Scholar 

  4. Kirlik, G., Oguz, C.: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on single machine. Comput. Oper. Res. 39, 1506–1520 (2012)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

  7. Potts, C.N., Van Wassenhove, L.N.: Algorithms for scheduling a single machine to minimize the weighted number of late tasks. Manage. Sci. 34(7), 843–858 (1988)

    Article  Google Scholar 

  8. Rinnoy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K.: Minimizing total costs in one-machine scheduling. Oper. Res. 25, 908–927 (1975)

    Google Scholar 

  9. Voß, S.: Tabu search: applications and prospects. In: Du, Z., Pardalos, P.M. (eds.) Network Optimization Problems: Algorithms, Applications and Complexity, pp. 333–353. World Scientific Publishing Co, Singapore (1993)

    Google Scholar 

  10. Sahni, S.K.: Algorithms for scheduling independent tasks. J. Assoc. Comput. Match 23, 116–127 (1976)

    Article  MathSciNet  Google Scholar 

  11. Uchroński, M.: Test instances for a single-machine total weighted tardiness scheduling problem. https://zasobynauki.pl/zasoby/51561

  12. Villareal, F.J., Bulfin, R.L.: Scheduling a single machine to minimize the weighted number of tardy tasks. IEE Trans. 15, 337–343 (1983)

    Article  Google Scholar 

  13. Wodecki, M.: A block approach to earliness-tardiness scheduling problems. Adv. Manuf. Technol. 40, 797–807 (2009). https://doi.org/10.1007/s00170-008-1395-7

    Article  Google Scholar 

  14. Wodecki, M., Bound, A.B.: 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, grant no. 8211104160 K34W04D03 of Wrocław University of Science and Technology, and computational grant No. 96 of Wrocław Centre for Networking and Supercomputing.

Author information

Authors and Affiliations

  1. Department of Control Systems and Mechatronics, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Wojciech Bożejko, Jarosław Pempera & Mariusz Uchroński

  2. 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. Jarosław Pempera
    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. Faculty of Engineering, University of Deusto, Bilbao, Spain

    Hugo Sanjurjo González

  2. Faculty of Engineering, University of Deusto, Bilbao, Spain

    Iker Pastor López

  3. Faculty of Engineering, University of Deusto, Bilbao, Spain

    Pablo García Bringas

  4. Department of Industrial Engineering, University of A Coruña, Ferrol, Spain

    Héctor Quintián

  5. BISITE Research Group, University of Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bożejko, W., Pempera, J., Uchroński, M., Wodecki, M. (2022). Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem. In: Sanjurjo González, H., Pastor López, I., García Bringas, P., Quintián, H., Corchado, E. (eds) 16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021). SOCO 2021. Advances in Intelligent Systems and Computing, vol 1401. Springer, Cham. https://doi.org/10.1007/978-3-030-87869-6_72

Download citation

Publish with us

Policies and ethics

Search

Navigation