Quantum annealing to solve the unrelated parallel machine scheduling problem

DOI10.1007/978-3-031-30445-3_14MaRDI QIDQ6135480zbMATHFDO

Authors F. Orts, A. M. Puertas, E. M. Garzón, Gloria Ortega

Publication date 25 August 2023

Published in Parallel Processing and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

adiabatic quantum computingquadratic unconstrained binary optimisationscheduling on unrelated parallel machines problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Quantum computation (81P68)

Recommendations

• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
• Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
• Performing fully parallel constraint logic programming on a quantum annealer
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Cites work

• A Modeling Language for Mathematical Programming
• A PTAS for scheduling unrelated machines of few different types
• Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Mixed integer programming models for job shop scheduling: A computational analysis
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• The unconstrained binary quadratic programming problem: a survey
• Using \(xQx\) to model and solve the uncapacitated task allocation problem

Cited in

(4)

• Application of quantum approximate optimization algorithm to job shop scheduling problem
• A quantum computing approach for the unit commitment problem
• High-speed train timetable optimization based on space-time network model and quantum simulator
• A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems

This page was built for publication: Quantum annealing to solve the unrelated parallel machine scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135480)