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 条
[1]   Bi-objective resource-constrained project scheduling problem with time-dependent resource costs [J].
Alcaraz, Javier ;
Anton-Sanchez, Laura ;
Saldanha-da-Gama, Francisco .
JOURNAL OF MANUFACTURING SYSTEMS, 2022, 63 :506-523
[2]   A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance [J].
An, Youjun ;
Chen, Xiaohui ;
Gao, Kaizhou ;
Zhang, Lin ;
Li, Yinghe ;
Zhao, Ziye .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 212
[3]   Greedy randomized adaptive search for dynamic flexible job-shop scheduling [J].
Baykasoglu, Adil ;
Madenoglu, Fatma S. ;
Hamzadayi, Alper .
JOURNAL OF MANUFACTURING SYSTEMS, 2020, 56 :425-451
[4]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[5]   Inverse scheduling: two-machine flow-shop problem [J].
Brucker, Peter ;
Shakhlevich, Natalia V. .
JOURNAL OF SCHEDULING, 2011, 14 (03) :239-256
[6]   Inverse scheduling with maximum lateness objective [J].
Brucker, Peter ;
Shakhlevich, Natalia V. .
JOURNAL OF SCHEDULING, 2009, 12 (05) :475-488
[7]   Flexible job-shop scheduling problem under resource constraints [J].
Chan, F. T. S. ;
Wong, T. C. ;
Chan, L. Y. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (11) :2071-2089
[8]   An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601