Cargando…
Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem
Scheduling problems have attracted the attention of researchers and practitioners for several decades. The quality of different methods developed to solve these problems on classical computers have been collected and compared in various benchmark repositories. Recently, quantum annealing has appeare...
Autores principales: | Kurowski, Krzysztof, Wȩglarz, Jan, Subocz, Marek, Różycki, Rafał, Waligóra, Grzegorz |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7304687/ http://dx.doi.org/10.1007/978-3-030-50433-5_39 |
Ejemplares similares
-
Evaluating the job shop scheduling problem on a D-wave quantum annealer
por: Carugno, Costantino, et al.
Publicado: (2022) -
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem
por: Meng, Leilei, et al.
Publicado: (2023) -
Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems
por: Shi, Xiaoqiu, et al.
Publicado: (2020) -
Solving problems with quantum annealing
por: Thom, Murray
Publicado: (2021) -
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem †
por: Viana, Monique Simplicio, et al.
Publicado: (2022)