Application of quantum approximate optimization algorithm to job shop scheduling problem
From MaRDI portal
Publication:6113354
DOI10.1016/j.ejor.2023.03.013OpenAlexW4323980869MaRDI QIDQ6113354
Rafal Rózycki, Tomasz Pecyna, Krzysztof Kurowski, Jan Weglarz, Mateusz Slysz, Grzegorz Waligóra
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.03.013
heuristicsschedulingjob shop scheduling problemcomputing sciencequantum approximate optimization algorithm
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical programming formulations for machine scheduling: A survey
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- A survey of priority rule-based scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- Adjustment of heads and tails for the job-shop problem
- The disjunctive graph machine representation of the job shop scheduling problem
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Deterministic job-shop scheduling: Past, present and future
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Complexity limitations on quantum computation
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- A new lower bound for the job-shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Rapid solution of problems by quantum computation
- Quantum computations: algorithms and error correction
- Quantum Complexity Theory
- Quantum complexity theory
- Job Shop Scheduling by Local Search
This page was built for publication: Application of quantum approximate optimization algorithm to job shop scheduling problem
