Quantum annealing solution for the unrelated parallel machine scheduling with priorities and delay of task switching on machines

Abstract

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 consists of three steps: quadratic approximation of cost function, a binary representation of parameter space, and solving the resulting Quadratic Unconstrained Binary Optimization on the quantum annealer platform D-Wave. One of the novelties in tackling this problem is the compaction of the model bearing in mind the repetitions of each task, to allow solving larger scheduling problems with the quantum resources available in the experimentation platform. An estimation of the number of qubits required in relation to the scheduling parameters is analyzed. The models have been implemented on the D-Wave platform and validated with respect to other traditional methods. Furthermore, the proposed extensions to consider priorities and to switch the delay of tasks have been analyzed using a case study.