Optimizing two-machine scheduling in flexible manufacturing systems using autonomous AI and quantum computing
Authors:
- Wojciech BożejkoWBWojciech Bożejko
- Sergii TrotskyiSTSergii Trotskyi
- Mariusz UchrońskiMUMariusz Uchroński
- Mieczysław WodeckiMWMieczysław Wodecki
- 7 November 2025
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 664
Abstract
No abstract availableFunding Information
- Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska
This publication has 17 references indexed in Scilit:
- Solving the resource constrained project scheduling problem with quantum annealingScientific Reports, 2024
- Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systemsAnnals of Operations Research, 2024
- Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problemFuture Generation Computer Systems, 2024
- Evaluating the job shop scheduling problem on a D-wave quantum annealerScientific Reports, 2022
- Quantum supremacy using a programmable superconducting processorNature, 2019
- Application of Quantum Annealing to Nurse Scheduling ProblemScientific Reports, 2019
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- Block approach—tabu search algorithm for single machine total weighted tardiness problemComputers & Industrial Engineering, 2006
- Minimizing the weighted number of tardy jobs on a two-machine flow shopComputers & Operations Research, 2003
- Scheduling in the two-machine flowshop with due date constraintsInternational Journal of Production Economics, 2001