Solving Two-Machine Sum-Cost Flow Shop Problem on D-Wave Quantum Annealer
- 24 April 2025
- book chapter
- Published by Springer Nature
- p. 69-78
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- 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
- Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer2023
- Two-machine flow shop scheduling with a common due date to maximize total early workEuropean Journal of Operational Research, 2022
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffsJournal of Scheduling, 2021
- Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristicsComputers & Operations Research, 2008
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- A fast tabu search algorithm for the permutation flow-shop problemEuropean Journal of Operational Research, 1996
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shopEuropean Journal of Operational Research, 1989
- Reducibility among Combinatorial Problems1972