Article Dans Une Revue Journal of Heuristics Année : 2026

Quantum annealing heuristics for the job shop scheduling problem with availability constraints

Riad Aggoune

Résumé

We study the Job Shop Scheduling Problem with machine Availability Constraints (JSSP-AC) within a quantum-annealing framework. Using a dummy-job transformation, both fixed and variable machine unavailability periods are incorporated into a standard time-indexed quadratic unconstrained binary optimization (QUBO) model. We then introduce a constructive heuristic H, its preemptive variant H∗, and three annealing-based methods: M1, based on a naive time horizon; M2, using the tighter bound returned by H; and M3, which additionally uses the heuristic solution as a warm start in a reverse-annealing setting. A proof-of-concept experiment on D-Wave hardware confirms that the proposed formulation can be embedded and solved on small instances. On a broader benchmark, H outperforms repaired dispatching heuristics, while the tighter horizon reduces QUBO size by 29.9%, quadratic terms by 46.4%, physical qubit usage by about 50%, and embedding time by 64%. The average optimality gap decreases from 18.3% for M1 to 5.0% for M2 and 3.3% for M3, highlighting the value of classical bounds and warm starts in quantum annealing for scheduling under machine unavailability.

Fichier principal
Vignette du fichier
Addressing_Machine_Unavailability_in_Job_Shop_Scheduling__A_Quantum_Computing_Approach.pdf (5.84 Mo) Télécharger le fichier

Dates et versions

hal-05611178 , version 1 (04-05-2026)

Licence

Identifiants

Citer

Samuel Deleplanque, Luis Fernando Pérez Armas, Riad Aggoune. Quantum annealing heuristics for the job shop scheduling problem with availability constraints. Journal of Heuristics, 2026, 32 (2), pp.19. ⟨10.1007/s10732-026-09594-5⟩. ⟨hal-05611178⟩
1 Consultations
4 Téléchargements

Altmetric

Partager

  • More