Skip to main content
SpringerLink
Log in

Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13353))

Included in the following conference series:

Abstract

In the work, we are proposing a new distributed quantum annealing method of algorithm construction for solving an NP-hard scheduling problem. A method of diversification of calculations has been proposed by dividing the space of feasible solutions and using the fact that the quantum annealer of the D-Wave machine is able to optimally solve (for now) small-size subproblems only. The proposed methodology was tested on a difficult instance of a single machine total weighted tardiness scheduling problem proposed by Lawler.

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

Notes

  1. 1.

    Assuming that quantum annealing will generate an optimal solution.

References

  1. Adamu, M.O., Adewumi, A.O.: A survey of single machine scheduling to minimize weighted number of tardy jobs. J. Ind. Manag. Optim. 10, 219–241 (2014)

    Article  MathSciNet  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, 219–231 (2017)

    Google Scholar 

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

    Article  Google Scholar 

  4. Chenga, T.C.E., Nga, C.T., Yuanab, J.J., Liua, Z.H.: Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165, 423–443 (2005)

    Article  MathSciNet  Google Scholar 

  5. Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated Dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 14, 52–67 (2002)

    Article  MathSciNet  Google Scholar 

  6. Den Basten, M., Stützle, T.: Ant colony optimization for the total weighted tardiness problem, precedings of PPSN-VI. Eur. J. Oper. Res. 1917, 611–620 (2000)

    Google Scholar 

  7. Lawler, E.L.: A “Pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331–342 (1977)

    Google Scholar 

  8. McGeoch, C.C.: Theory versus practice in annealing-based quantum computing. Theoret. Comput. Sci. 816, 169–183 (2020)

    Article  MathSciNet  Google Scholar 

  9. Rajba, P., Wodecki, M.: Stability of scheduling with random processing times on one machine. Applicationes Mathematicae 39, 169–183 (2012)

    Article  MathSciNet  Google Scholar 

  10. Rinnooy 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 

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

    Article  Google Scholar 

Download references

Acknowledgments

Calculations have been partially carried out using resources provided by Wroclaw Centre for Networking and Supercomputing (http://wcss.pl), grant No. 96.

Author information

Authors and Affiliations

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

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

  2. Wroclaw Centre for Networking and Supercomputing, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Mariusz Uchroński

  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. 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. Brunel University London, London, UK

    Derek Groen

  2. University of Amsterdam, Amsterdam, The Netherlands

    Clélia de Mulatier

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

    Maciej Paszynski

  4. University of Amsterdam, Amsterdam, The Netherlands

    Valeria V. Krzhizhanovskaya

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

    Jack J. Dongarra

  6. University of Amsterdam, Amsterdam, The Netherlands

    Peter M. A. Sloot

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). Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem. In: Groen, D., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds) Computational Science – ICCS 2022. ICCS 2022. Lecture Notes in Computer Science, vol 13353. Springer, Cham. https://doi.org/10.1007/978-3-031-08760-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-08760-8_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-08759-2

  • Online ISBN: 978-3-031-08760-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation