Quantum annealing to solve the unrelated parallel machine scheduling problem

DOI10.1007/978-3-031-30445-3_14zbMath1529.90043MaRDI QIDQ6135480

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

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)

Cites Work

• A Modeling Language for Mathematical Programming
• 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
• The unconstrained binary quadratic programming problem: a survey
• Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
• Using \(xQx\) to model and solve the uncapacitated task allocation problem
• A PTAS for Scheduling Unrelated Machines of Few Different Types
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

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