Cited By
View all- Ciacco AGuerriero FMacrina G(2025)Review of quantum algorithms for medicine, finance and logisticsSoft Computing10.1007/s00500-025-10540-zOnline publication date: 25-Feb-2025
Solving Scheduling Problems with Quantum Computing: a Study on Flexible Open Shop
Abstract
Despite quantum computing is revealing an increasingly promising technology that has the potential to introduce a significant speed-up in many areas of computation, the number of problems that it can represent and solve is currently rather limited. Therefore, one of the current challenges faced by the quantum computing community is to broaden the class of problems that can be tackled. Among these problems, scheduling problems are a class of particularly interesting and hard combinatorial problems; in this paper, we present a novel solution for representing and solving the Flexible Open Shop Scheduling Problem (FOSSP) to optimality by minimizing the makespan. We firstly present a compact formulation of this problem as a Quadratic unconstrained binary optimization (QUBO), which can be used to solve this problem with a quantum annealer. Then, we proceed to the Quantum Approximate Optimization Algorithm (QAOA) problem formulation, thus producing both the cost and mix Hamiltonians related to the problem. From the Hamiltonians, we provide the complete description of the quantum circuit that can be used to tackle the FOSSP within the QAOA framework. This second approach can be used to solve the optimization problem with a general-purpose quantum gate-based hardware.
References
[1]
Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour, and T.C.E. Cheng. 2021. Four decades of research on the open-shop scheduling problem to minimize the makespan. European Journal of Operational Research 295, 2 (2021), 399--426.
[2]
Martin Anthony, Endre Boros, Yves Crama, and Aritanan Gruber. 2017. Quadratic reformulations of nonlinear binary optimization problems. Math. Program. 162, 1--2 (2017), 115--144.
[3]
Danyu Bai, Zhi-Hai Zhang, and Qiang Zhang. 2016. Flexible open shop scheduling problem to minimize makespan. Computers & Operations Research 67 (2016), 207--215.
[4]
Marco Baioletti. 2022. Probabilistic reasoning as quadratic unconstrained binary optimization. In GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9 -- 13, 2022, Jonathan E. Fieldsend and Markus Wagner (Eds.). ACM, 2177--2181.
[5]
Marco Baioletti and Francesco Santini. 2022. Abstract Argumentation Goes Quantum: An Encoding to QUBO Problems. In PRICAI 2022: Trends in Artificial Intelligence - 19th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2022, Shanghai, China, November 10--13, 2022, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 13629), Sankalp Khanna, Jian Cao, Quan Bai, and Guandong Xu (Eds.). Springer, 46--60.
[6]
Xavier Bonet-Monroig, Hao Wang, Diederick Vermetten, Bruno Senjean, Charles Moussa, Thomas Bäck, Vedran Dunjko, and Thomas E. O'Brien. 2023. Performance comparison of optimization methods on variational quantum algorithms. Physical Review A 107, 3 (mar 2023).
[7]
Costantino Carugno, Maurizio Ferrari Dacrema, and Paolo Cremonesi. 2022. Evaluating the job shop scheduling problem on a D-wave quantum annealer. Scientific Reports 12, 1 (2022), 6539.
[8]
E. Farhi, J. Goldstone, and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv preprint arXiv:1411.4028 (November 2014).
[9]
Franz G. Fuchs, Herman Øie Kolden, Niels Henrik Aase, and Giorgio Sartor. 2021. Efficient Encoding of the Weighted MAX $$k$$-CUT on a Quantum Computer Using QAOA. SN Computer Science 2, 2 (2021), 89.
[10]
Fred W. Glover, Gary A. Kochenberger, and Yu Du. 2019. Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. 4OR 17, 4 (2019), 335--371.
[11]
Stuart Hadfield, Zhihui Wang, Bryan O'Gorman, Eleanor Rieffel, Davide Venturelli, and Rupak Biswas. 2019. From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz. Algorithms 12, 2 (Feb 2019), 34.
[12]
PL Hammer and S Rudeanu. 1968. Boolean Methods in Operations Research and Related Areas, Ökonometrie und Unternehmensforschung/Econometrics and Operations Research. Springer, Berlin 1007 (1968), 978--3.
[13]
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose. 2011. Quantum annealing with manufactured spins. Nature 473 (2011), 194--198.
[14]
Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, and Yang Wang. 2014. The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 1 (2014), 58--81.
[15]
Andrew Lucas. 2014. Ising formulations of many NP problems. Frontiers in Physics 2 (2014).
[16]
Sascha Mücke, Nico Piatkowski, and Katharina Morik. 2019. Learning Bit by Bit: Extracting the Essence of Machine Learning. In Proceedings of the Conference on "Lernen, Wissen, Daten, Analysen" (CEUR Workshop Proceedings, Vol. 2454). CEUR-WS.org, 144--155.
[17]
Michael A. Nielsen and Isaac L. Chuang. 2011. Quantum Computation and Quantum Information: 10th Anniversary Edition (10th ed.). Cambridge University Press, New York, NY, USA.
[18]
Michael L. Pinedo. 2008. Scheduling: Theory, Algorithms, and Systems (3rd ed.). Springer Publishing Company, Incorporated.
[19]
John Preskill. 2018. Quantum Computing in the NISQ era and beyond. Quantum 2 (Aug. 2018), 79.
[20]
Ruslan Shaydulin, Phillip C. Lotshaw, Jeffrey Larson, James Ostrowski, and Travis S. Humble. 2023. Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut. ACM Transactions on Quantum Computing 4, 3 (apr 2023), 1--15.
[21]
Vicente P. Soloviev, Concha Bielza, and Pedro Larrañaga. 2022. Quantum Approximate Optimization Algorithm for Bayesian network structure learning. CoRR abs/2203.02400 (2022). arXiv:2203.02400
[22]
Vicente P. Soloviev, Pedro Larrañaga, and Concha Bielza. 2022. Quantum Parametric Circuit Optimization with Estimation of Distribution Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (Boston, Massachusetts) (GECCO '22). Association for Computing Machinery, New York, NY, USA, 2247--2250.
Index Terms
- Solving Scheduling Problems with Quantum Computing: a Study on Flexible Open Shop
Recommendations
Non-commuting two-local Hamiltonians for quantum error suppression
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error ...
Quantum annealing solution for the unrelated parallel machine scheduling with priorities and delay of task switching on machines
AbstractQuantum computing has emerged in recent years as an alternative to classical computing, which could improve the latter in solving some types of problems. One of the quantum programming models, Adiabatic Quantum Computing, has been successfully ...
Highlights- Solving the scheduling of unrelated parallel machines problem using quantum annealer.
- The scheduling considers the priority of kinds of tasks.
- The scheduling includes delays due to the switches between kinds of tasks on machines.
Template-Based Minor Embedding for Adiabatic Quantum Optimization
Quantum annealing (QA) can be used to quickly obtain near-optimal solutions for quadratic unconstrained binary optimization (QUBO) problems. In QA hardware, each decision variable of a QUBO should be mapped to one or more adjacent qubits in such a way ...
Comments
Information & Contributors
Information
Published In
July 2023
2519 pages
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '23 Companion
Sponsor:
GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation
July 15 - 19, 2023
Lisbon, Portugal
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 127Total Downloads
- Downloads (Last 12 months)55
- Downloads (Last 6 weeks)7
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Ciacco AGuerriero FMacrina G(2025)Review of quantum algorithms for medicine, finance and logisticsSoft Computing10.1007/s00500-025-10540-zOnline publication date: 25-Feb-2025
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in