Research on rush order insertion rescheduling problem under hybrid flow shop based on NSGA-III

Rush order insertion is widespread in the enterprises that apply make-to-order production mode which affects the stability of production system. This article studies rush order insertion rescheduling problem (ROIRP) under hybrid flow shop (HFS) with multiple stages and multiple machines. A mathematical model simultaneously considering constraints such as lots, sequence-dependent set-up times and transportation times with objectives to minimise makespan, total transportation time and total machine deviation between the initial scheduling plan and the event-driven rescheduling plan is developed and NSGA-III is applied to solve the problem. Three groups of experiments are carried out which verify the suitability of NSGA-III for HFS scheduling problem with multi-objective and multi-constraint, the effectiveness of NSGA-III for the proposed ROIRP and the feasibility and effectiveness of the proposed model and algorithm in solving the ROIRP of a realistic ship pipe parts manufacturing enterprise.

[1]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[2]  Tieke Li,et al.  Rescheduling Algorithm for Steelmaking-Continuous Casting , 2007, 2007 2nd IEEE Conference on Industrial Electronics and Applications.

[3]  Kannan Govindan,et al.  Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food , 2014 .

[4]  Kaveh Amouzgar,et al.  Multi-objective optimization using Genetic Algorithms , 2012 .

[5]  Ling Wang,et al.  Decoding methods for the flow shop scheduling with peak power consumption constraints , 2019, Int. J. Prod. Res..

[6]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[7]  Yufang Chiu,et al.  Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop , 2012 .

[8]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[9]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[10]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[11]  Gupta J.N.D. TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[12]  Liang Gao,et al.  A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling , 2019, Swarm Evol. Comput..

[13]  Ali Azadeh,et al.  Multi-objective open shop scheduling by considering human error and preventive maintenance , 2019, Applied Mathematical Modelling.

[14]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[15]  R. G. Petrakian,et al.  Trade-offs in cycle time management: hot lots , 1992 .

[16]  Tianyou Chai,et al.  Scheduling a real-world hybrid flow shop with variable processing times using Lagrangian relaxation , 2014, Proceeding of the 11th World Congress on Intelligent Control and Automation.

[17]  Kejia Zhuang,et al.  Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems , 2017, Comput. Ind. Eng..

[18]  Andrea Rossi,et al.  Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships , 2014 .

[19]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

[20]  Mehmet Fatih Tasgetiren,et al.  Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion , 2016, Knowl. Based Syst..

[21]  Adil Baykasoğlu,et al.  Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach , 2017, Int. J. Prod. Res..

[22]  Lei Yue,et al.  Multi objective lotsizing and scheduling with material constraints in flexible parallel lines using a Pareto based guided artificial bee colony algorithm , 2019, Comput. Ind. Eng..

[23]  Feng Liu,et al.  Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization , 2016, Soft Comput..

[24]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[25]  Liang Gao,et al.  An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..

[26]  Rubén Ruiz,et al.  Flow shop rescheduling under different types of disruption , 2013 .

[27]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[28]  Bo Fang,et al.  An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint , 2019, Comput. Ind. Eng..

[29]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[30]  Quan-Ke Pan,et al.  An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem , 2018, Swarm Evol. Comput..