Hybrid Quantum Annealing Approach for Huge Neighborhoods Searching in Application to Task Scheduling
- 6 January 2026
- book chapter
- Published by Springer Nature
- p. 127-138
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Comparison of D-Wave Quantum Computing Environment Solvers for a Two-Machine Jobs Scheduling Problem2024
- Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problemFuture Generation Computer Systems, 2024
- A survey of recently developed metaheuristics and their comparative analysisEngineering Applications of Artificial Intelligence, 2022
- A survey of adaptive large neighborhood search algorithms and applicationsComputers & Operations Research, 2022
- A survey on new generation metaheuristic algorithmsComputers & Industrial Engineering, 2019
- A branch-and-bound parallel algorithm for single-machine total weighted tardiness problemThe International Journal of Advanced Manufacturing Technology, 2007
- On the theoretical properties of swap multimovesOperations Research Letters, 2007
- Block approach—tabu search algorithm for single machine total weighted tardiness problemComputers & Industrial Engineering, 2006
- A survey of very large-scale neighborhood search techniquesDiscrete Applied Mathematics, 2002
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977