Cargando…
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introd...
Autores principales: | Luo, Qifang, Zhou, Yongquan, Xie, Jian, Ma, Mingzhi, Li, Liangliang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4163327/ https://www.ncbi.nlm.nih.gov/pubmed/25243220 http://dx.doi.org/10.1155/2014/630280 |
Ejemplares similares
-
A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
por: Liu, Ruochen, et al.
Publicado: (2013) -
A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop
por: Zhou, Tao, et al.
Publicado: (2023) -
Cloud Model Bat Algorithm
por: Zhou, Yongquan, et al.
Publicado: (2014) -
A computational efficient optimization of flow shop scheduling problems
por: Liang, Zhongyuan, et al.
Publicado: (2022) -
Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates
por: Ren, Tao, et al.
Publicado: (2014)