A multi-objective flexible job-shop cell scheduling problem with sequence-dependent family setup times and intercellular transportation by improved NSGA-II. (April 2022)

• Record Type: Journal Article
• Authors: Han, Yaoyao; Chen, Xiaohui; Xu, Minmin; An, Youjun; Gu, Fengshou; Ball, Andrew D
• Is Part Of: Proceedings of the Institution of Mechanical Engineers. Volume 236:Number 5(2022)
• Page Start: 540
• Page End: 556
• Publication Date: 2022-04
• Subjects: Cellular manufacturing system -- flexible job-shop cell scheduling -- intercellular transportation times -- sequence-dependent family setup time -- energy consumption -- multi-objective optimization; Mechanical engineering -- Periodicals; Engineering -- Management -- Periodicals; Manufacturing processes -- Periodicals; 629.8
• DOI: 10.1177/09544054211044660
• Languages: English
• ISSNs: 0954-4054

Abstract

With the development of Industry 4.0 and requirement of smart factory, cellular manufacturing system (CMS) has been widely concerned in recent years, which may leads to reducing production cost and wip inventory due to its flexibility production with groups. Intercellular transportation consumption, sequence-dependent setup times, and batch issue in CMS are taken into consideration simultaneously in this paper. Afterwards, a multi-objective flexible job-shop cell scheduling problem (FJSCP) optimization model is established to minimize makespan, total energy consumption, and total costs. Additionally, an improved non-dominated sorting genetic algorithm is adopted to solve the problem. Meanwhile, for improving local search ability, hybrid variable neighborhood (HVNS) is adopted in selection, crossover, and mutation operations to further improve algorithm performance. Finally, the validity of proposed algorithm is demonstrated by datasets of benchmark scheduling instances from literature. The statistical result illustrates that improved method has a better or an equivalent performance when compared with some heuristic algorithms with similar types of instances. Besides, it is also compared with one type scalarization method, the proposed algorithm exhibits better performance based on hypervolume analysis under different instances.