Cargando…
A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling
Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minim...
Autores principales: | Deng, Qianwang, Gong, Guiliang, Gong, Xuran, Zhang, Like, Liu, Wei, Ren, Qinghua |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5387816/ https://www.ncbi.nlm.nih.gov/pubmed/28458687 http://dx.doi.org/10.1155/2017/5232518 |
Ejemplares similares
-
Multiobjective de novo drug design with recurrent neural networks and nondominated sorting
por: Yasonik, Jacob
Publicado: (2020) -
Research of Flexible Assembly Job-Shop Batch–Scheduling Problem Based on Improved Artificial Bee Colony
por: Li, Xiulin, et al.
Publicado: (2022) -
Artificial Bee Colony Algorithm Applied to Dynamic Flexible Job Shop Problems
por: Ferreira, Inês C., et al.
Publicado: (2020) -
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)