Comparison of D-Wave Quantum Computing Environment Solvers for a Two-Machine Jobs Scheduling Problem
- 16 November 2024
- book chapter
- Published by Springer Nature
- p. 68-76
Abstract
No abstract availableKeywords
This publication has 12 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
- A two-machine flowshop scheduling problem with precedence constraint on two jobsSoft Computing, 2015
- A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lagsInternational Journal of Operational Research, 2015
- A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delaysRAIRO - Operations Research, 2014
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- A performance evaluation of permutation vs. non-permutation schedules in a flowshopInternational Journal of Production Research, 2006
- 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