Survey on Distributed Assembly Permutation Flowshop Scheduling Problem

被引：0
作者：
Zhang, Jing [1 ]
Song, Hongbo [2 ]
Lin, Jian [3 ]
机构：
[1] Department of Computer and Information Security, Zhejiang Police College, Hangzhou
[2] College of Information Science and Technology, Zhejiang Shuren University, Hangzhou
[3] Department of Artificial Intelligence, Zhejiang University of Finance and Economics, Hangzhou
来源：
Computer Engineering and Applications | 2024年 / 60卷 / 06期
关键词：
distributed assembly; permutation flowshop; resource scheduling; search algorithms;
D O I：
10.3778/j.issn.1002-8331.2307-0276
中图分类号：
TP181 [自动推理、机器学习];
学科分类号：
摘要：
As the rapid development of modern manufacturing, the past decades have witnessed a trend in which jobs are firstly processed in distributed production factories and then assembled into the final products in an assembly factory after completion. Such manufacturing mode brings many advantages as well as some new challenges on resource scheduling. This paper surveys literature on the distributed assembly permutation flowshop scheduling problem (DAPFSP). Firstly, the background and main issues in DAPFSP are introduced. Then, mathematical models, encoding and decoding schemes, and global and local search algorithms are thoroughly discussed for DAPFSP with the objective of minimizing the maximal completion time. Additionally, recent advances on DAPFSP with various objectives, such as total flow time, DAPFSP with other constraints like no-wait, and DAPFSP by taking issues including setup time into consideration are also surveyed. Finally, several future research directions worthy further investigation are pointed out. © 2024 Editorial Department of Scientia Agricultura Sinica. All rights reserved.
引用
收藏
页码：1 / 9
页数：8
相关论文
共 54 条
[1]  
BEHNAMIAN J, FATEMI GHOMI S M T., A survey of multifactory scheduling, Journal of Intelligent Manufacturing, 27, pp. 231-249, (2016)
[2]  
NADERI B, RUIZ R., The distributed permutation flowshop scheduling problem, Computer & Operation Research, 37, pp. 754-768, (2010)
[3]  
WANG L, DENG J, WANG S Y., Survey on optimization algorithms for distributed shop scheduling, Control and Decision, 31, 1, pp. 1-11, (2016)
[4]  
KOMAKI G, SHEIKH S, MALAKOOTI B., Flow shop scheduling problems with assembly operations: a review and new trends, International Journal of Production Research, 57, 10, pp. 2926-2955, (2019)
[5]  
KOULAMAS C, KYPARISIS G J., The three-stage assembly flowshop scheduling problem, Computer & Operation Research, 28, pp. 689-704, (2001)
[6]  
HATAMI S, RUIZ R, ANDRES-ROMANO C., The distributed assembly permutation flowshop scheduling problem[J], InternationalJournalof ProductionResearch, 51, 17, pp. 5292-5308, (2013)
[7]  
WANG L., Shop scheduling with genetic algorithms, pp. 1-2, (2003)
[8]  
WANG W L, WU Q D., Intelligent algorithms and applications for production scheduling, pp. 1-3, (2007)
[9]  
JOHNSON S M., Optimal two and three- stage production schedules with set up times included, Naval Research Logistics Quarterly, 1, 1, pp. 61-68, (1954)
[10]  
OSMAN I H, POTTS C N., Simulated annealing for permutation flow-shop scheduling, Omega, 17, 6, pp. 551-557, (1989)
123456