Quantum annealing solution for the unrelated parallel machine scheduling with priorities and delay of task switching on machines
Metadatos
Mostrar el registro completo del ítemAutor
Orts Gómez, Francisco José; Puertas López, Antonio Manuel; Ortega López, Gloria; Martín Garzón, Gracia EsterFecha
2023-11-01Resumen
Quantum 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 used to solve problems such as graph partitioning, traffic routing, and task scheduling. In this paper, the focus is on the scheduling of the problem of unrelated parallel machines, where the processing time of tasks on any of the available processing elements is known. Moreover, the proposed model is extended in two relevant aspects for this kind of problem: the existence of some degree of priority of tasks, and the introduction of a delay or penalty every time a processing unit or machine changes the type of task that executes.
In all cases, the problem is expressed as Quadratic Unconstrained Binary Optimization, which can be subsequently solved using quantum annealers. The quantum nonlinear programming framework discussed in this work consi...
Palabra/s clave
Quantum Computing
Adiabatic Quantum Computing
Quantum annealing
Quadratic Unconstrained Binary Optimisation
Combinatorial Optimization
Scheduling on unrelated parallel machines problem