Flexible flow shop scheduling with interval grey processing time

被引:16
作者
Wang, Yuquan [1 ]
Xie, Naiming [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
Grey system theory; Flexible flow shop scheduling; Uncertain processing time; Artificial bee colony algorithm; GENETIC ALGORITHM; OPTIMIZATION ALGORITHM; JOB; 2-STAGE;
D O I
10.1108/GS-09-2020-0123
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Purpose - purpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop. Design/methodology/approach - A flexible flow scheduling model and algorithm with interval grey processing time is established. First, according to actual needs of composite laminate shop scheduling process, interval grey number is used to represent uncertain processing time, and interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart, and other methods are further applied. Then a flexible flow shop scheduling model with interval grey processing time (G-FFSP) is established, and an artificial bee colony algorithm based on an adaptive neighbourhood search strategy is designed to solve the model. Finally, six examples are generated for simulation scheduling, and the efficiency and performance of the model and algorithm are evaluated by comparing the results. Findings - Results show that flexible flow shop scheduling model and algorithm with interval grey processing time can provide an optimal solution for composite lay-up shop scheduling problems and other similar flow shop scheduling problems. Social implications - Uncertain processing time is common in flexible workshop manufacturing, and manual scheduling greatly restricts the production efficiency of workshop. In this paper, combined with grey system theory, an intelligent algorithm is used to solve flexible flow shop scheduling problem to promote intelligent and efficient production of enterprises. Originality/value - This paper applies and perfects interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart and other methods. Aflexible flow shop scheduling model with interval grey processing time is established, and an artificial bee colony algorithm with an adaptive domain search strategy is designed. It provides a comprehensive solution for flexible flow shop scheduling with uncertain processing time.
引用
收藏
页码:779 / 795
页数:17
相关论文
共 50 条
[41]   Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time [J].
Zabihzadeh, Seyedeh Sarah ;
Rezaeian, Javad .
APPLIED SOFT COMPUTING, 2016, 40 :319-330
[42]   An uncertain permutation flow shop predictive scheduling problem with processing interruption [J].
Shen, Jiayu ;
Shi, Yuanji ;
Shi, Jianxin ;
Dai, Yunzhong ;
Li, Wei .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 611
[43]   Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times [J].
Chen, Jiapeng ;
Wang, Chun ;
Xu, Binzi ;
Liu, Sheng .
APPLIED SCIENCES-BASEL, 2025, 15 (05)
[44]   Flow Shop Scheduling with Auxiliary Time based on Simulation Optimization [J].
Yuan, Yulin ;
Tao, Yifei ;
Bing, Xiaofeng .
2017 9TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC 2017), 2017, :1032-1037
[45]   Flexible job-shop scheduling with tolerated time interval and limited starting time interval based on hybrid discrete PSO-SA: An application from a casting workshop [J].
Tang, Hongtao ;
Chen, Rong ;
Li, Yibing ;
Peng, Zhao ;
Guo, Shunsheng ;
Du, Yuzhu .
APPLIED SOFT COMPUTING, 2019, 78 :176-194
[46]   Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time [J].
Lin, Jian .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 77 :186-196
[47]   METAHEURISTIC ALGORITHMS FOR FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES [J].
Asadi-Gangraj, Ebrahim .
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2019, 26 (06) :850-865
[48]   A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time [J].
Cai, Jingcao ;
Lei, Deming .
COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (05) :2235-2253
[49]   Stochastic flexible flow shop scheduling problem with limited buffers and fixed interval preventive maintenance: a hybrid approach of simulation and metaheuristic algorithms [J].
Rooeinfar, R. ;
Raissi, S. ;
Ghezavati, V. R. .
SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2019, 95 (06) :509-528
[50]   A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems [J].
Trung Hieu Tran ;
Ng, Kien Ming .
ENGINEERING OPTIMIZATION, 2013, 45 (04) :483-502