Scheduling for energy-efficient manufacturing using quantum annealing

An increasing number of manufacturers are adopting on-site renewable energy systems to reduce energy costs, which introduces new challenges for process scheduling in energy-efficient manufacturing. In flexible job shop systems, the fluctuating availability of renewable sources makes energy supply decisions closely dependent on production schedules, increasing scheduling complexity. Traditional optimization methods face rapidly growing computational demands as problem size and complexity increase. To address these challenges, this study proposes a quantum annealing based scheduling approach for energy efficient manufacturing integrating process and energy supply scheduling. The objective is to minimize energy cost, energy consumption, and makespan in flexible job shop systems with an integrated energy generation system. The approach is analyzed on benchmark instances with real energy data and compared with a classical method combined with simulated annealing and tabu search. The evaluation, based on widely used performance metrics in multi-objective optimization, demonstrates that the quantum annealing-based method achieves better solution quality in cardinality, convergence, distribution, and spread. Additionally, a comparative analysis of computing times shows that the proposed method outperforms the classical method, demonstrating its potential for practical applications.

Authors

Publication Details

Journal
Digital engineering.
Published
2026-02-25
DOI
https://doi.org/10.1016/j.dte.2026.100091
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling for energy-efficient manufacturing using quantum annealing

Jan C. Aurich, Xiangqian Wu, Philipp Schworm, Marcel Wagner
Digital engineering.
Quantum Computing Algorithms and Architecture
article

Scheduling for energy-efficient manufacturing using quantum annealing

Jan C. Aurich, Xiangqian Wu, Philipp Schworm, Marcel Wagner
article en

Abstract

An increasing number of manufacturers are adopting on-site renewable energy systems to reduce energy costs, which introduces new challenges for process scheduling in energy-efficient manufacturing. In flexible job shop systems, the fluctuating availability of renewable sources makes energy supply decisions closely dependent on production schedules, increasing scheduling complexity. Traditional optimization methods face rapidly growing computational demands as problem size and complexity increase. To address these challenges, this study proposes a quantum annealing based scheduling approach for energy efficient manufacturing integrating process and energy supply scheduling. The objective is to minimize energy cost, energy consumption, and makespan in flexible job shop systems with an integrated energy generation system. The approach is analyzed on benchmark instances with real energy data and compared with a classical method combined with simulated annealing and tabu search. The evaluation, based on widely used performance metrics in multi-objective optimization, demonstrates that the quantum annealing-based method achieves better solution quality in cardinality, convergence, distribution, and spread. Additionally, a comparative analysis of computing times shows that the proposed method outperforms the classical method, demonstrating its potential for practical applications.

Digital engineering.Vol. 9
Affordable and clean energy
Openalex Percentile: Top 48%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.