Research on rush order insertion rescheduling problem under hybrid flow shop with multi-objective and multi-constraint

HE Xiao-mei; DONG Shao-hua

doi:10.13374/j.issn2095-9389.2018.11.27.002

Volume 41 Issue 11

Dec. 2019

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2019 > 41(11): 1450-1457

HE Xiao-mei, DONG Shao-hua. Research on rush order insertion rescheduling problem under hybrid flow shop with multi-objective and multi-constraint[J]. Chinese Journal of Engineering, 2019, 41(11): 1450-1457. doi: 10.13374/j.issn2095-9389.2018.11.27.002

Citation:

HE Xiao-mei, DONG Shao-hua. Research on rush order insertion rescheduling problem under hybrid flow shop with multi-objective and multi-constraint[J]. Chinese Journal of Engineering, 2019, 41(11): 1450-1457. doi: 10.13374/j.issn2095-9389.2018.11.27.002

Citation:

PDF( 1381 KB)

Research on rush order insertion rescheduling problem under hybrid flow shop with multi-objective and multi-constraint

doi: 10.13374/j.issn2095-9389.2018.11.27.002

HE Xiao-mei^,,
DONG Shao-hua

School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China

More Information

Corresponding author: E-mail: 18813127630@163.com
Received Date: 2018-11-27
Publish Date: 2019-11-01

Abstract

Abstract

To study the multi-objective rush order insertion rescheduling problem under hybrid flow shop with multiple stages and multiple machines, the constraints, such as job lots, sequence-dependent set-up times, and round-trip transportation times, were simultaneously considered. A static optimal scheduling model of initial orders was first established to minimize the maximum order completion time and minimize the total transportation time. The non-dominated sorting genetic algorithm (NSGA)-II algorithm was applied to solve a two-objective optimal problem. Then, for the rush order insertion disturbance factor, the objective to minimize the total machine deviation between the initial scheduling and rescheduling plans was added as a stability index to establish an optimal rush order rescheduling model. The NSGA-III algorithm based on the event-driven rescheduling strategy and order rearrangement strategy was applied to solve a three-objective optimal problem. Finally, a realistic ship pipe parts manufacturing enterprise is regarded as a study case. Two sets of experiments are carried out to explain the motivation of the selected method. The performances of the NSGA-II and NSGA-III algorithms are evaluated by three metrics, including the mean ideal distance, spread of non-dominated solution, and percentage of domination. The results show that the NSGA-II algorithm is more suitable for solving two-objective optimal problem, whereas NSGA-III algorithm performs better in solving three-objective optimal problems. Then, the proposed model and method were applied to 10 rush order insertion cases of the enterprise. All the three objectives were improved according to the compared results obtained by the actual and optimal scheduling. The optimal rate is close to one third, which verifies the feasibility of the proposed model and the effectiveness of the proposed method. The proposed model and method may assist other enterprises that apply make-to-order production mode to reduce the impact of rush order insertion and realize a win-win mechanism between enterprises and customers.
- hybrid flow shop,
- rush order insertion rescheduling,
- multi-objective,
- multi-constraint,
- NSGA-III algorithm

FullText(HTML)

References(16)

References

[1]	Gupta J N D. Two-stage, hybrid flowshop scheduling problem. J Operational Res Soc, 1988, 39(4): 359 doi: 10.1057/jors.1988.63
[2]	Meng T, Pan Q K, Li J Q, et al. An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evolutionary Comput, 2018, 38: 64 doi: 10.1016/j.swevo.2017.06.003
[3]	Rossi A. Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. Int J Prod Economics, 2014, 153: 253 doi: 10.1016/j.ijpe.2014.03.006
[4]	Yue L, Guan Z L, Zhang L, et al. Multi-objective lotsizing and scheduling with material constraints in flexible parallel lines using a Pareto based guided artificial bee colony algorithm. Comput Ind Eng, 2019, 128: 659 doi: 10.1016/j.cie.2018.12.065
[5]	Qin H B, Fan P F, Tang H T, et al. An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint. Comput Ind Eng, 2019, 128: 458 doi: 10.1016/j.cie.2018.12.061
[6]	Vieira G E, Herrmann J W, Lin E. Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Scheduling, 2003, 6(1): 39 doi: 10.1023/A:1022235519958
[7]	Wu S D, Storer R H, Pei C C. One-machine rescheduling heuristics with efficiency and stability as criteria. Comput Operations Res, 1993, 20(1): 1 doi: 10.1016/0305-0548(93)90091-V
[8]	Cui Z, Gu X S. A discrete group search optimizer for hybrid flow-shop scheduling problem with random breakdown. Math Probl Eng, 2014, 24: 621393
[9]	Wang K, Choi S H. A decomposition-based approach to flexible flow shop scheduling under machine breakdown. Int J Prod Res, 2012, 50(1): 215 doi: 10.1080/00207543.2011.571456
[10]	Gao K Z, Suganthan P N, Pan Q K, et al. Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowledge-Based Syst, 2016, 109: 1 doi: 10.1016/j.knosys.2016.06.014
[11]	Chiu Y F, Shih C J. Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop. Int J Prod Res, 2012, 50(20): 5783 doi: 10.1080/00207543.2011.627887
[12]	Wang D J, Liu F, Wang J J, et al. Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization. Soft Comput, 2016, 20(4): 1635 doi: 10.1007/s00500-015-1615-7
[13]	裴海燕, 蔣祖華, 胡家文, 等. 插單擾動下流水線生產與維護的重調度優化. 工業工程與管理, 2017, 22(1):50 Pei H Y, Jiang Z H, Hu J W, et al. Integrating rescheduling with preventive maintenance in the flow-shop problem under rush order. Ind Eng Manage, 2017, 22(1): 50
[14]	Deb K, Jain H. An evolutionary many-objective optimization algorithm using reference-point-based non-dominated sorting approach, Part I: solving problems with box constraints. IEEE Trans Evolutionary Comput, 2014, 18(4): 577 doi: 10.1109/TEVC.2013.2281535
[15]	Qi X T, Bard J F, Yu G. Disruption management for machine scheduling: the case of SPT schedules. Int J Prod Economics, 2006, 103(1): 166 doi: 10.1016/j.ijpe.2005.05.021
[16]	Govindan K, Jafarian A, Khodaverdi R, et al. Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int J Prod Economics, 2014, 152: 9 doi: 10.1016/j.ijpe.2013.12.028