Skip to main content
SpringerLink
Log in

An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine

  • Conference paper
  • First Online:
Advanced, Contemporary Control (PCC 2023)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 709))

Included in the following conference series:

Abstract

This paper considers the problem of maximizing the total weighted number of on-time jobs on a single machine. Using the problem as a case study, we present a new approach to solving NP-hard discrete optimization problems using D-Wave’s QPU quantum processor architecture implementing quantum annealing. Although optimization on a quantum machine does not guarantee optimality, the hybrid method of construction of the partitioning and constraint algorithm proposed in this paper, using together CPU and QPU as well as Lagrange relaxation for upper bounds determination, makes it possible to determine the exact, optimal solution.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Atsmony, M., Mosheiov, G.: Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. J. Sched. (2022). https://doi.org/10.1007/s10951-022-00745-7

    Article  MATH  Google Scholar 

  2. Bożejko, W., Pempera, J., Uchroński, M., Wodecki, M.: 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, vol. 13353. LNCS, pp. 171–178. Springer (2022). https://doi.org/10.1007/978-3-031-08760-8_15

  3. Gerstl, E., Mosheiov, G.: Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. J. Sched. 23(3), 289–299 (2020)

    Article  MathSciNet  Google Scholar 

  4. Hejl L., Š\(\mathring{u}\)cha P., Novák A., Hanzálek Z.: Minimizing the weighted number of tardy jobs on a single machine. Euro. J. Operat. Res. 298(2), 413–424 (2022)

    Google Scholar 

  5. Karp R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.)Complexity of Computer Computation, New York, pp. 85–104 (1972)

    Google Scholar 

  6. Koulamas, C.: Maximizing the weighted number of on-time jobs in single machine scheduling with time windows. Math. Comput. Model. 25(10), 57–62 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mor, B., Mosheiov, G.: Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper. Res. Int. Journal 22(3), 2707–2719 (2022)

    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. Shabtay, D., Steiner, G.: Scheduling to maximize the number of just-in-time jobs: A survey. Springer Optimiz. Appli. 60, 3–20 (2012). https://doi.org/10.1007/978-1-4614-1123-9-1

    Article  MathSciNet  MATH  Google Scholar 

  10. Uchroński M.: Benchmark instances files. https://data.e-science.pl/51561/1WiTiTestData.zip. (Accessed 19 Feb 2023)

Download references

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. Silesian University of Technology, Gliwice, Poland

    Marek Pawelczyk

  2. Silesian University of Technology, Gliwice, Poland

    Dariusz Bismor

  3. Silesian University of Technology, Gliwice, Poland

    Szymon Ogonowski

  4. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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. (2023). An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine. In: Pawelczyk, M., Bismor, D., Ogonowski, S., Kacprzyk, J. (eds) Advanced, Contemporary Control. PCC 2023. Lecture Notes in Networks and Systems, vol 709. Springer, Cham. https://doi.org/10.1007/978-3-031-35173-0_8

Download citation

Publish with us

Policies and ethics

Search

Navigation