Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Procedia CIRP

Quantum-enhanced discrete-event simulation and optimization of sequence-dependent job scheduling with setup times

Christopher Sowinski, Yufei Feng, Simon Schlichte, Oguz Kedilioglu, Jörg E. Franke, Sebastian Reitelshöfer

Published Jan 1, 2026• 1 citation
Publisher

Abstract

Process simulation tools, such as discrete-event simulation (DES), offer domain experts low-barrier environments for designing and evaluating industrial processes, avoiding the expense and complexity of physical prototypes. While classical optimization approaches are routinely embedded in DES workflows, quantum-enhanced optimization remains largely unexplored. With the emergence of advanced quantum computing hardware, integrating it into industrial optimization has become realistic and the potential to unlock faster, more cost-effective solutions for complex scheduling, routing, and resource allocation compared to classical methods. To broaden its adoption among domain experts without a background in quantum theory, we must offer intuitive, application-oriented software tools. Yet the ecosystem of such frameworks is vast, and guidance is lacking as to which platform or library best suits a given domain expert´s needs. In this work, we bridge the gap between DES and quantum optimization by first conducting a literature review of existing quantum application-oriented optimization frameworks. From these findings, we derive recommendations, answering which tools and platforms engineers or researchers can choose to formulate and test their DES optimization problems across multiple quantum backends. Building on our survey, we introduce a theoretical framework that integrates quantum-optimization algorithms directly into the DES optimization cycle. We then apply this framework to the benchmark sequence-dependent job-scheduling problem with setup times (SDJST), which, to the best of our knowledge, constitutes one of the first quantum-enabled simulation-optimization studies for this problem. We further validate that classical optimization approaches outperform for smaller problem sizes, whereas the quantum approach becomes increasingly promising as the problem size grows.

DOI
10.1016/j.procir.2025.10.003

Related papers

Quantum Computing for Scheduling Problems: A Survey

Sirine Ben Ammar, Bilel Marzouki, Olfa Belkahla Driss

In recent years, quantum computing has emerged as a rapidly advancing interdisciplinary field, attracting growing attention from both academia and industry owing to its fundamentally novel approach to information processing and its potential to achieve computational capabilities beyond the reach of classical systems. This paper presents a structured review of quantum computing approaches applied to scheduling problems, which are among the most challenging NP-hard optimization problems. We first introduce fundamental principles of quantum computing, including gate-based models, quantum annealing, and hybrid frameworks. We then explore how various scheduling problems such as job-shop, flow-shop, and project scheduling-are encoded into quantum models, particularly using QUBO formulations suitable for current quantum devices. Finally, we discuss key limitations such as hardware constraints and model scalability, and we identify research directions to advance quantumenhanced scheduling methods. By grounding theory in empirical case studies and highlighting near-term deployable solutions, this study bridges the gap between quantum algorithm development and practical scheduling demands, offering a roadmap for researchers and practitioners in quantum optimization.

IEEE Afro-Mediterranean Conference on Artificial Intelligence (AMCAI)•Oct 14, 2025•0 citations

Quantum-Inspired Computing Approaches for Complex Optimization Problems in Industrial Engineering

Arjun Sen, Hiba Rashid, Nikhil Joshi

Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.

VW Applied Sciences•Aug 12, 2019•0 citations

A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study

Hila Safi, Karen Wintersperger, Oliver von Sicard +2 more

Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.

cs.ARCross-listedarXiv:2607.13325•Jul 16, 2026•1 citation

Quantum-Inspired Industrial Scheduling on Nanoscale Platforms

Chun‐Cheng Lin, Zhen-Yin Annie Chen, He-Yau Kang +1 more

Quantum-inspired optimization (QIO) has emerged as a promising paradigm for solving complex combinatorial problems in industrial scheduling. While most existing studies focus on algorithmic developments and classical implementations, recent advances in nanoscale computing, including memristor-based Ising machines, photonic computing systems, and oscillatory neural networks, have created new opportunities for implementing QUBO- and Ising-based optimization through physical hardware dynamics. This survey provides a comprehensive review of QIO techniques for industrial scheduling, with a particular emphasis on their compatibility with emerging nanoscale computing platforms. We first introduce how representative scheduling problems, including job shop, flexible job shop, and resource-constrained scheduling, can be reformulated into quadratic unconstrained binary optimization (QUBO) models. We then categorize QIO methods into annealing- and Ising-based methods, evolutionary and population-based methods, hybrid quantum-classical and decomposition methods, and emerging learning-augmented approaches, and examine their computational characteristics and compatibility with QUBO or Ising hardware. Beyond algorithmic perspectives, this work highlights the potential role of specialized Ising hardware in enabling highly parallel and potentially energy-efficient optimization. We discuss how QUBO and Ising formulations can be mapped to physical energy-minimization processes in nanoscale devices, thereby providing a computational framework that connects classical optimization, quantum-inspired algorithms, and nanoscale hardware systems. Finally, we identify key challenges, including scalability, penalty calibration, and system integration, and outline future research directions toward hybrid quantum-classical computing ecosystems incorporating nanoscale optimization hardware. This survey positions QIO as a promising paradigm for next-generation intelligent manufacturing, in which optimization algorithms and nanoscale hardware are jointly developed to support low-latency and energy-efficient decision-making.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 citations

Quantum Optimization Applications With Quark and Quapps: Bridging the Gap Between Application and Hardware [Focus: Quantum Software and its Engineering]

Lukas Windgätter, Elisabeth Lobe

Solving discrete optimization problems is one of the most promising use cases on quantum computers with tremendous potential both in research and industry. We present two libraries quark and quapps which provide an easily usable, modular workflow to encode discrete optimization problems and interface them to both classical and quantum hardware. We provide a collection of already implemented optimization problems which can be easily adapted by the user and run on different solvers. From this we derive an additional instance data set that can directly be used to benchmark and test quantum hardware. In conjunction both libraries and the instance data set enable both expert and non-expert users to easily implement optimization problems, run them on classical and quantum machines and simplify benchmarking on quantum machines.

IEEE Software•May 1, 2025•4 citations

Optimizing Distributed Systems With Quantum Computing

Manish Patil, Shraddha Sanjay Mhetre

As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.

International Journal of Advances in Signal and Image Sciences•Sep 25, 2025•0 citations
Process simulation tools, such as discrete-event simulation (DES), offer domain experts low-barrier environments for designing and evaluating industrial processes, avoiding the expense and complexity of physical prototypes. While classical optimization approaches are routinely embedded in DES workflows, quantum-enhanced optimization remains largely unexplored. With the emergence of advanced quantum computing hardware, integrating it into industrial optimization has become realistic and the potential to unlock faster, more cost-effective solutions for complex scheduling, routing, and resource allocation compared to classical methods. To broaden its adoption among domain experts without a background in quantum theory, we must offer intuitive, application-oriented software tools. Yet the ecosystem of such frameworks is vast, and guidance is lacking as to which platform or library best suits a given domain expert´s needs. In this work, we bridge the gap between DES and quantum optimization by first conducting a literature review of existing quantum application-oriented optimization frameworks. From these findings, we derive recommendations, answering which tools and platforms engineers or researchers can choose to formulate and test their DES optimization problems across multiple quantum backends. Building on our survey, we introduce a theoretical framework that integrates quantum-optimization algorithms directly into the DES optimization cycle. We then apply this framework to the benchmark sequence-dependent job-scheduling problem with setup times (SDJST), which, to the best of our knowledge, constitutes one of the first quantum-enabled simulation-optimization studies for this problem. We further validate that classical optimization approaches outperform for smaller problem sizes, whereas the quantum approach becomes increasingly promising as the problem size grows.
In recent years, quantum computing has emerged as a rapidly advancing interdisciplinary field, attracting growing attention from both academia and industry owing to its fundamentally novel approach to information processing and its potential to achieve computational capabilities beyond the reach of classical systems. This paper presents a structured review of quantum computing approaches applied to scheduling problems, which are among the most challenging NP-hard optimization problems. We first introduce fundamental principles of quantum computing, including gate-based models, quantum annealing, and hybrid frameworks. We then explore how various scheduling problems such as job-shop, flow-shop, and project scheduling-are encoded into quantum models, particularly using QUBO formulations suitable for current quantum devices. Finally, we discuss key limitations such as hardware constraints and model scalability, and we identify research directions to advance quantumenhanced scheduling methods. By grounding theory in empirical case studies and highlighting near-term deployable solutions, this study bridges the gap between quantum algorithm development and practical scheduling demands, offering a roadmap for researchers and practitioners in quantum optimization.
Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.
Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.
Quantum-inspired optimization (QIO) has emerged as a promising paradigm for solving complex combinatorial problems in industrial scheduling. While most existing studies focus on algorithmic developments and classical implementations, recent advances in nanoscale computing, including memristor-based Ising machines, photonic computing systems, and oscillatory neural networks, have created new opportunities for implementing QUBO- and Ising-based optimization through physical hardware dynamics. This survey provides a comprehensive review of QIO techniques for industrial scheduling, with a particular emphasis on their compatibility with emerging nanoscale computing platforms. We first introduce how representative scheduling problems, including job shop, flexible job shop, and resource-constrained scheduling, can be reformulated into quadratic unconstrained binary optimization (QUBO) models. We then categorize QIO methods into annealing- and Ising-based methods, evolutionary and population-based methods, hybrid quantum-classical and decomposition methods, and emerging learning-augmented approaches, and examine their computational characteristics and compatibility with QUBO or Ising hardware. Beyond algorithmic perspectives, this work highlights the potential role of specialized Ising hardware in enabling highly parallel and potentially energy-efficient optimization. We discuss how QUBO and Ising formulations can be mapped to physical energy-minimization processes in nanoscale devices, thereby providing a computational framework that connects classical optimization, quantum-inspired algorithms, and nanoscale hardware systems. Finally, we identify key challenges, including scalability, penalty calibration, and system integration, and outline future research directions toward hybrid quantum-classical computing ecosystems incorporating nanoscale optimization hardware. This survey positions QIO as a promising paradigm for next-generation intelligent manufacturing, in which optimization algorithms and nanoscale hardware are jointly developed to support low-latency and energy-efficient decision-making.
Solving discrete optimization problems is one of the most promising use cases on quantum computers with tremendous potential both in research and industry. We present two libraries quark and quapps which provide an easily usable, modular workflow to encode discrete optimization problems and interface them to both classical and quantum hardware. We provide a collection of already implemented optimization problems which can be easily adapted by the user and run on different solvers. From this we derive an additional instance data set that can directly be used to benchmark and test quantum hardware. In conjunction both libraries and the instance data set enable both expert and non-expert users to easily implement optimization problems, run them on classical and quantum machines and simplify benchmarking on quantum machines.
As systems become more complex and large-scale, there is a need for more effective scheduling algorithms to maximize resource usage and minimize job completion times. The older methods of scheduling like First-Come-First-Serve (FCFS) and Round Robin (RR), although easier to compute, tend to perform poorly in dynamic scenarios because they cannot manage intricate constraints and multi-objective optimization efficiently. As traditional methods approach their limit of performance, quantum computing presents a potentially fruitful avenue for conquering combinatorial challenges based on its ability to examine many states at once. This work proposes a quantum-aided scheduling framework that employs Quadratic Unconstrained Binary Optimization (QUBO) formulations and quantum solvers for the purpose of improving job scheduling in distributed environments. The original contribution is the marrying of quantum optimization (with IBM Qiskit's QAOA and D-Wave's hybrid solvers) with traditional distributed computing frameworks such as Apache Spark. Google Cluster Workload Traces are employed to mimic real-world situations, and jobs are described by CPU, memory requirements, and arrival times. Once the scheduling problem has been formulated into a QUBO model, quantum algorithms produce the optimized job-to-machine assignments. The outcomes are compared against baseline classical schedulers on performance metrics including make span, throughput, and resource utilization. The experiment demonstrates that quantum-assisted scheduling significantly improves makespan and enhances resource utilization, particularly under high workloads. It also provides evidence of the feasibility of integrating quantum solvers with existing big data infrastructures.