Cargando…
A computational efficient optimization of flow shop scheduling problems
Flow shop scheduling problems are NP-hard problems. Heuristic algorithms and evolutionary metaheuristic algorithms are commonly used to solve this kind of problem. Although heuristic algorithms have high solving speed, the solution quality is not good. Evolutionary algorithms make up for this defect...
Autores principales: | Liang, Zhongyuan, Zhong, Peisi, Liu, Mei, Zhang, Chao, Zhang, Zhenyu |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8764078/ https://www.ncbi.nlm.nih.gov/pubmed/35039598 http://dx.doi.org/10.1038/s41598-022-04887-8 |
Ejemplares similares
-
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
por: Luo, Qifang, et al.
Publicado: (2014) -
Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
por: Hidri, Lotfi, et al.
Publicado: (2014) -
Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated
por: Branda, Antonella, et al.
Publicado: (2021) -
Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates
por: Ren, Tao, et al.
Publicado: (2014) -
Day Surgery Scheduling and Optimization in Large Public Hospitals in China: A Three-Station Job Shop Scheduling Problem
por: Bai, Xue, et al.
Publicado: (2022)