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...

Descripción completa

Detalles Bibliográficos
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:
Research Article
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

Internet

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