Scheduling to minimize stringer utilization for continuous annealing operations

In this paper we present a mathematical program and heuristic algorithms to schedule coils for the production operations in a copper (or steel) coil manufacturing industry. The processing facility uses continuous operations for processing (e.g., galvanizing and annealing) while the handling unit is a discrete coil. The ends of coils are “stitched” or welded together to enable continuous processing, and the joint is later sheared off to obtain the processed coils. Processing constraints impose restrictions on the compatibility between a pair of coils that are overcome by introducing a dummy coil called stringer, which is very expensive to a mill. This paper deals with modeling the sequencing/scheduling problem of coils on parallel non-identical machines to minimize stringer utilization. Both computational and practical experiences show the efficiency and effectiveness of the solution approaches. Implementing these methods in an actual coil annealing facility resulted in 65% reduction in stringer utilization.

[1]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..

[2]  Lixin Tang,et al.  Scheduling a single semi-continuous batching machine , 2008 .

[3]  Richard E. Box,et al.  A Scheduling Model for LTV Steel's Cleveland Works' Twin Strand Continuous Slab Caster , 1988 .

[4]  E. Nowicki,et al.  Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach , 1996 .

[5]  Michel Gendreau,et al.  Scheduling a hot rolling mill , 2007, J. Oper. Res. Soc..

[6]  C. J. Liao,et al.  Sequencing heuristics for dependent setups in a continuous process industry , 1996 .

[7]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[8]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[9]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[10]  Lixin Tang,et al.  A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

[11]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[12]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[13]  José Humberto Ablanedo-Rosas,et al.  Makespan and workstation utilization minimization in a flowshop with operations flexibility , 2011 .

[14]  Andrew N. Hrymak,et al.  Scheduling of the batch annealing process — deterministic case , 1999 .

[15]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[16]  Xiaoyue Zhang,et al.  Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server , 2010, Comput. Ind. Eng..

[17]  Peter Cowling,et al.  A flexible decision support system for steel hot rolling mill scheduling , 2003, Comput. Ind. Eng..

[18]  Michel Gendreau,et al.  The hot strip mill production scheduling problem: A tabu search approach , 1998, Eur. J. Oper. Res..

[19]  Lixin Tang,et al.  A review of planning and scheduling systems and methods for integrated steel production , 2001, Eur. J. Oper. Res..

[20]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs , 1997 .

[21]  Hyung-Woo Park,et al.  An efficient scheduling algorithm for the hot coil making in the steel mini-mill , 2002 .

[22]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .