Discrete particle swarm optimisation combined with no-wait algorithm in stages for scheduling mill roller annealing process

In this paper, a mill roll annealing operation scheduling problem is investigated against the background of a cast steel plant of Machinery & Mill Roll Co., Ltd in mainland China. During the annealing processes, a roller needs to be processed in multistage process with different types of furnaces and there is no waiting between the stages. Based on the analysis of the feature of the mill roll annealing process, this problem can be formulated as a no-wait hybrid flow shop scheduling problem, of which the ‘job’ is a batch of rough roll, and the ‘machine’ is a heating furnace. As each batch will be of different sizes, the jobs will have different sizes and processing times. According to the no-wait characteristic between two sequential operations of a job, the no-wait algorithm in stages is designed to obtain the initial solution. Combined with the no-wait algorithm in stages, a discrete particle swarm optimisation algorithm has been developed to solve the integer programming model. In the simulation experiment with real data, the applicability and the effectiveness of algorithms are demonstrated by the comparisons and the analysis of the experiment results, and the equipment reformation strategies of the actual reference value are given as well which is beneficial for the policy-maker to arrange production reasonably. Furthermore, some large-scale instances about the no-wait hybrid flow shop scheduling problem are studied effectively.

[1]  Ching-Jong Liao,et al.  A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2008 .

[2]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[3]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[4]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

[5]  Christos Koulamas,et al.  A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines , 2007, Eur. J. Oper. Res..

[6]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[7]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[8]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

[10]  Mohammad Reza Amin-Naseri,et al.  Hybrid flow shop scheduling with parallel batching , 2009 .

[11]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[12]  ZhangWei,et al.  Hybrid flow shop scheduling , 1999 .

[13]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[14]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[15]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[16]  Marie-Claude Portmann,et al.  Flow shop scheduling problem with limited machine availability: A heuristic approach , 2003 .

[17]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[18]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

[19]  Tom V. Mathew Genetic Algorithm , 2022 .

[20]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[21]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[22]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[23]  Fengshan Bai,et al.  No-wait flexible flowshop scheduling with no-idle machines , 2005, Oper. Res. Lett..

[24]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[25]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.