An Iterative Greedy Algorithm With Q-Learning Mechanism for the Multiobjective Distributed No-Idle Permutation Flowshop Scheduling

被引：60

作者：

Zhao F. ^{[1
]}

Zhuang C. ^{[2
]}

Wang L. ^{[2
]}

Dong C. ^{[3
]}

机构：

[1] Lanzhou University of Technology, School of Computer and Communication Technology, Lanzhou

[2] Tsinghua University, Department of Automation, Beijing

[3] Qingdao Hengxing University of Science and Technology, Department Automotive Engineering, Qingdao

来源：

IEEE Transactions on Systems, Man, and Cybernetics: Systems | 2024年 / 54卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Distributed permutation no-idle flowshop; iterative greedy algorithm; makespan; total tardiness (TTD);

D O I：

10.1109/TSMC.2024.3358383

中图分类号：

学科分类号：

摘要：

The distributed no-idle permutation flowshop scheduling problem (DNIPFSP) has widely existed in various manufacturing systems. The makespan and total tardiness are optimized simultaneously considering the variety of scales of the problems with introducing an improved iterative greedy (IIG) algorithm. The variable neighborhood descent (VND) algorithm is applied to the local search method of the iterative greedy algorithm. Two perturbation operators based on the critical factory are proposed as the neighborhood structure of VND. In the destruction phase, the scale of the destruction varies with the size of the problem. An insertion operator-based perturbation strategy sorts the undeleted jobs after the destruction phase. The Q -learning mechanism for selecting the weighting coefficients is introduced to obtain a relatively small objective value. Finally, the proposed algorithm is tested on a benchmark suite and compared with other existing algorithms. The experiments show that the IIG algorithm obtained more satisfactory results. © 2013 IEEE.

引用

页码：3207 / 3219

页数：12

共 50 条

[1]

Chen S., Pan Q.K., Gao L., Sang H., A populationbased iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem, Eng. Appl. Artif. Intell, 104, (2021)

[2]

Huang Y., Pan Q.K., Gao L., An effective memetic algorithm for the distributed flowshop scheduling problem with an assemble machine, Int. J. Prod. Res, 61, 6, pp. 1755-1770, (2022)

[3]

Li Y., Pan Q.K., Li J., Gao L., Tasgetiren M.F., An Adaptive iterated greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems, Swarm Evol. Comput, 63, (2021)

[4]

Lu C., Gao L., Yi J., Li X., Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A realworld case from automobile industry in China, IEEE Trans. Ind. Informat, 17, 10, pp. 6687-6696, (2021)

[5]

Perez-Gonzalez P., Framinan J.M., A review and classification on distributed permutation flowshop scheduling problems, Eur. J. Oper. Res, 312, 1, pp. 1-21, (2024)

[6]

Wang J., Wang L., A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop, IEEE Trans. Syst., Man, Cybern., Syst, 50, 5, pp. 1805-1819, (2020)

[7]

Zhao F., Ma R., Wang L., A self-learning discrete Jaya algorithm for multiobjective energy-efficient distributed no-idle flowshop scheduling problem in heterogeneous factory system, IEEE Trans. Cybern, 52, 12, pp. 12675-12686, (2022)

[8]

Adiri I., Pohoryles D., Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times, Naval Res. Logist. Quart, 29, 3, pp. 495-504, (1982)

[9]

Riahi V., Chiong R., Zhang Y., A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion, Comput. Oper. Res, 117, (2020)

[10]

Zhao F., Zhang L., Zhang Y., Ma W., Zhang C., Song H., A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion, Expert Syst. Appl, 146, (2020)

← 1 2 3 4 5 →