Research on Multi-objective Golden Eagle Optimizer for No-tardiness Job Shop Scheduling Problems with Overtime Consideration

被引:0
作者
Shi S. [1 ]
Xiong H. [1 ]
机构
[1] School of Machinery and Automation, Wuhan University of Science and Technology, Wuhan
来源
Zhongguo Jixie Gongcheng/China Mechanical Engineering | 2023年 / 34卷 / 17期
关键词
job shop scheduling; multi-objective golden eagle optimizer; no-tardiness; overtime;
D O I
10.3969/j.issn.1004-132X.2023.17.007
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Delivery on time was one of the important goals of the production operations in make-to-order industries. When the production load of the manufacturing system was heavy, overtime work was the most commonly used efective measure to ensure the delivery time. In order to realize the no-tardiness delivery of order tasks and the optimal use of overtime hours, a multi-objective no-tardiness job shop scheduling problem considering overtime was proposed, and a mathematical model with the objective of minimizing the total overtime hours and the makespan was established. To solve the problem efectively, a multi-objective golden eagle optimizer was proposed. In the algorithm, a coding method was designed to map the continuous solution space to the discrete solution space of the problem, a two-stage decoding scheme was proposed, an elitist no-dominated sorting selection operator was integrated, and an adaptive ofspring individual generation strategy was introduced. The efectiveness and superiority of the proposed algorithm were verified by comparison experiments on 23 modified job shop scheduling problem benchmarks as experimental objects. © 2023 China Mechanical Engineering Magazine Office. All rights reserved.
引用
收藏
页码:2077 / 2088
页数:11
相关论文
共 25 条
[1]  
WU Xiuli, LIU Xiajing, Differential Evolution Algorithm for Solving Distributed Flexible Job Shop Scheduling Problem[J], Computer Integrated Manufacturing System, 25, 10, pp. 2539-2558, (2019)
[2]  
HE L J, LI W F, CHIONG R, Et al., Optimizing the Job-shop Scheduling Problem Using a Multi-objective Jaya Algorithm[J], Applied Soft Computing, 111, (2021)
[3]  
Min DAI, WANG Hui, Green Job Shop Scheduling Based on Genetic Annealing Algorithm[J], Modern Manufacturing Engineering, 5, pp. 26-31, (2021)
[4]  
YAZDANI M, ALETI A, KHALITI S, Et al., Optimizing the Sum of Maximum Earliness and Tardiness of the Job Shop Scheduling Problem, Computers & Industrial Engineering, 107, pp. 12-24, (2017)
[5]  
WANG Qiulian, DUAN Xinghao, Scheduling of Flexible Job Shop Based on High-dimension and Multi-objective Migrating Bird Optimization Algo-rithm[J], China Mechanical Engineering, 33, 21, pp. 2601-2612, (2022)
[6]  
CHAND S, SCHNEEBERGER H., Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Jobs[J], European Journal of Operational Research, 34, 2, pp. 221-230, (1988)
[7]  
ZHAO C L, TANG H Y., Single Machine Scheduling Problems with Deteriorating Jobs, Applied Mathematics and Computation, 161, 3, pp. 865-874, (2005)
[8]  
SOROUSH H., On the Scheduling with Past-sequence-dependent Setup Times and Learning Effects on a Single Machine[J], International Journal of Advanced Manufacturing Technology, 68, pp. 2483-2487, (2013)
[9]  
HOLLOWAY C, NELSON R., Job Shop Scheduling with Due Dates and Overtime Capability [J], Institute for Operations Research and the Management Science, 21, 1, pp. 68-78, (1974)
[10]  
CHEN Shuling, LI Tieke, WANG Bailin, An Optimization Model and Algorithms for Order Acceptance Problem with Overtime Strategy, Industrial Engineering Journal, 18, 2, pp. 1-8, (2015)