Scheduling model and heuristic algorithm for roller annealing

The scheduling problem of the annealing operation of roller in an annealing shop of a roller corporation is studied. The annealing operation of roller (AOR) is a process in which the cast rough roller is processed by high-temperature furnace, low-temperature furnace and pit working procedures, and finally is formed to the roller. There are different kinds of machines in each working procedure of the annealing process and the job waiting is not allowed between any two working procedures. This problem is formulated as a no-wait hybrid flow shop (NWHFS) scheduling model, and a mathematical model to minimize the makespan is constructed and the no-wait policy is directly in the objective function. In this way, the constraints of the model are simplified and the difficulty for solving the model is reduced. A priority processing heuristic algorithm based on the processing time is proposed to solve the model. An experiment based on a set of data taken from the practical industry production demonstrates the practicality of the model and the effectiveness of the algorithm.

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

[2]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[3]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..

[4]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[5]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[6]  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.

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

[8]  J.-C. Billaut,et al.  Resolution of some 2-stage hybrid flowshop scheduling problems , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[9]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

[10]  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..

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

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

[13]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

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