title: Discrete bat algorithm for optimal problem of permutation flow shop scheduling.
abstract: 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 introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.
authors.affiliation: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China.
authors.forename: Qifang
authors.initials: Q
authors.lastname: Luo
authors.affiliation: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China.
authors.forename: Yongquan
authors.initials: Y
authors.lastname: Zhou
authors.affiliation: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China.
authors.forename: Jian
authors.initials: J
authors.lastname: Xie
authors.affiliation: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China.
authors.forename: Mingzhi
authors.initials: M
authors.lastname: Ma
authors.affiliation: College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China.
authors.forename: Liangliang
authors.initials: L
authors.lastname: Li
mesh_terms: D000465:Algorithms; D003198:Computer Simulation / Q000592:standards; D012985:Software Design