版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Jilin Univ Sch Mech Sci & Engn Dept Ind Engn Changchun Jilin Peoples R China
出 版 物:《JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING》 (工业工程学刊)
年 卷 期:2017年第34卷第7期
页 面:542-550页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学]
基 金:National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC)
主 题:Artificial immune system algorithm permutation flow shop scheduling makespan
摘 要:To minimize makespan in the permutation flow shop scheduling problem, a modified immunoglobulin-based artificial immune system algorithm (M-IAIS) is developed to search for a job sequence. The basic structure of immunoglobulin-based artificial immune system algorithm consists of three parts, somatic recombination, hypermutation, and isotype switching. A special process, named B cell repertoire updating, is considered in M-IAIS algorithm to accelerate the convergence speed. Taillard s benchmark problems are chosen as test instances. Percentage deviation, hypothesis test, convergence performance, and robust analysis are considered in the paper to evaluate the performance of M-IAIS algorithm. Computational results show that M-IAIS algorithm is competitive for the permutation flow shop scheduling problem.