TY - JOUR
T1 - Improved Bacterial Foraging Algorithm for Cell Formation and Product Scheduling Considering Learning and Forgetting Factors in Cellular Manufacturing Systems
AU - Wang, Jufeng
AU - Liu, Chunfeng
AU - Zhou, Meng Chu
N1 - Funding Information:
Manuscript received March 6, 2019; revised September 22, 2019; accepted December 26, 2019. Date of publication February 5, 2020; date of current version June 3, 2020. This work was supported in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LY19A010007 and Grant LY19G020015, in part by the Humanities and Social Sciences Foundation of the PRC Ministry of Education under Grant 19YJA630078 and Grant 17YJC630093, and in part by the Major Project of the National Social Science Fund of China under Grant 17ZDA054. (Corresponding author: MengChu Zhou.) J. Wang is with the Department of Information and Computing Science, China Jiliang University, Hangzhou 310018, China (e-mail: wang_jufeng@163.com).
Publisher Copyright:
© 2007-2012 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - This article designs a joint decision model to solve cell formation and product scheduling problems together in cellular manufacturing systems. Multifunctional machines and multiskilled workers need to be grouped and assigned to work cells. Because of the latter's learning and forgetting effects, the production rate of each operation that requires the same machine function and is handled by the same pair of a machine and worker is different. Each product with an operation sequence is allowed to move from one machine to another for processing its subsequent operation, which may reduce product processing time at the expense of additional product movement time. In order to solve this intertwined optimization problem, an improved bacterial foraging algorithm (IBFA) is proposed to minimize makespan. In IBFA, a bacterium returns to the best position, once a worse tumble or swimming result occurs. Each bacterium can, thus, always go ahead toward favorable positions in the chemotactic procedure. In IBFA's reproduction strategy, half of the best bacteria are retained; while new bacteria are produced via crossover operations, and selectively retained. Through this method, high-quality and diversified population is produced. Moreover, in the reproduction and elimination-dispersal strategies of IBFA, the best bacterium can be retained to the subsequent generation through a population sorting method. Computational experiments and t-test are conducted to show that the proposed algorithm has the better performance than the classical one, genetic algorithm and two hybridized bacterial foraging algorithms given the same computational budget.
AB - This article designs a joint decision model to solve cell formation and product scheduling problems together in cellular manufacturing systems. Multifunctional machines and multiskilled workers need to be grouped and assigned to work cells. Because of the latter's learning and forgetting effects, the production rate of each operation that requires the same machine function and is handled by the same pair of a machine and worker is different. Each product with an operation sequence is allowed to move from one machine to another for processing its subsequent operation, which may reduce product processing time at the expense of additional product movement time. In order to solve this intertwined optimization problem, an improved bacterial foraging algorithm (IBFA) is proposed to minimize makespan. In IBFA, a bacterium returns to the best position, once a worse tumble or swimming result occurs. Each bacterium can, thus, always go ahead toward favorable positions in the chemotactic procedure. In IBFA's reproduction strategy, half of the best bacteria are retained; while new bacteria are produced via crossover operations, and selectively retained. Through this method, high-quality and diversified population is produced. Moreover, in the reproduction and elimination-dispersal strategies of IBFA, the best bacterium can be retained to the subsequent generation through a population sorting method. Computational experiments and t-test are conducted to show that the proposed algorithm has the better performance than the classical one, genetic algorithm and two hybridized bacterial foraging algorithms given the same computational budget.
KW - Bacteria foraging algorithm (BFA)
KW - cellular manufacturing system (CMS)
KW - learning and forgetting
KW - precedence constraints
KW - product scheduling
UR - http://www.scopus.com/inward/record.url?scp=85086075174&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086075174&partnerID=8YFLogxK
U2 - 10.1109/JSYST.2019.2963222
DO - 10.1109/JSYST.2019.2963222
M3 - Article
AN - SCOPUS:85086075174
SN - 1932-8184
VL - 14
SP - 3047
EP - 3056
JO - IEEE Systems Journal
JF - IEEE Systems Journal
IS - 2
M1 - 8984281
ER -