An improved memetic algorithm for multi-objective resource-constrained flexible job shop inverse scheduling problem: An application for machining workshop

被引:16
作者
Wei, Shupeng [1 ,2 ]
Tang, Hongtao [1 ,2 ]
Li, Xixing [3 ]
Lei, Deming [4 ]
Wang, Xi Vincent [5 ]
机构
[1] Wuhan Univ Technol, Sch Mech & Elect Engn, Wuhan 430070, Peoples R China
[2] Hubei Prov Engn Res Ctr Robot & Intelligent Mfg, Wuhan, Peoples R China
[3] Hubei Univ Technol, Sch Mech Engn, Wuhan, Peoples R China
[4] Wuhan Univ Technol, Sch Automat, Wuhan, Peoples R China
[5] KTH Royal Inst Technol, Dept Prod Engn, Stockholm, Sweden
基金
中国国家自然科学基金;
关键词
Resource constrained flexible job shop; scheduling; Inverse scheduling; Multi -objective optimization; Memetic algorithm; GENETIC ALGORITHM; OPTIMIZATION ALGORITHM; SEARCH; TIME;
D O I
10.1016/j.jmsy.2024.03.005
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Resource -constrained flexible job shop scheduling problems are commonly encountered in some manufacturing industries, and have been widely studied in recent years. However, traditional resource constrained flexible job shop scheduling problem rarely consider the uncertainties in actual manufacturing systems, which may make the original schedule become suboptimal or even unfeasible. Therefore, a resource constrained flexible job shop inverse scheduling problem (RCFJISP) is proposed in this paper, which aims to cope with uncertain events by simultaneously adjusting the machine, worker and process parameters of the original schedule. A multi -objective optimization model is constructed to minimize the makespan, worker cost, machine energy consumption and deviation index. Furthermore, an improved memetic algorithm (IMA) is developed for solving the proposed problem. In IMA, a novel double -layer encoding mechanism is designed to enhance the capacity in exploring new solution's domains. Three initialization strategies utilizing original scheduling information are designed to improve the quality of initial solutions. An adaptive mutation strategy and a local search mechanism are designed to enhance exploration and exploitation ability of the algorithm. And a crowding operator is proposed to reflect the diversity of the population effectively. In computational experiments, 28 extended benchmarks are constructed, and the effectiveness of the proposed strategy and algorithm is verified by comparing IMA with its 4 variants and other 4 widely used algorithms. Finally, two inverse scheduling problems of a real -world hydraulic cylinder machining workshop under two uncertain situations are studied. The results demonstrate that IMA can effectively solve the actual inverse scheduling problem. With a slight adjustment to the original scheduling, it can reduce the makespan by 11.5%, the worker cost by 8.1% and the machine energy consumption by 27.9% on average.
引用
收藏
页码:264 / 290
页数:27
相关论文
共 54 条
[51]   An effective genetic algorithm for the flexible job-shop scheduling problem [J].
Zhang, Guohui ;
Gao, Liang ;
Shi, Yang .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) :3563-3573
[52]   An Improved Mayfly Method to Solve Distributed Flexible Job Shop Scheduling Problem under Dual Resource Constraints [J].
Zhang, Shoujing ;
Hou, Tiantian ;
Qu, Qing ;
Glowacz, Adam ;
Alqhtani, Samar M. ;
Irfan, Muhammad ;
Krolczyk, Grzegorz ;
Li, Zhixiong .
SUSTAINABILITY, 2022, 14 (19)
[53]   An efficient hybrid integer and categorical particle swarm optimization algorithm for the multi-mode multi-project inverse scheduling problem in turbine assembly workshop [J].
Zhang, Yahui ;
Hu, Xiaofeng ;
Cao, Xianfeng ;
Wu, Chuanxun .
COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169
[54]  
Zitzler E., 2001, TIK REPORT, P103