Scheduling a single semi-continuous batching machine

This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O(n2), respectively.

[1]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[2]  Bertrand M. T. Lin,et al.  Scheduling in an assembly-type production chain with batch transfer , 2007 .

[3]  Lixin Tang,et al.  A mathematical programming model for scheduling steelmaking-continuous casting production , 2000, Eur. J. Oper. Res..

[4]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[5]  Mihalis Yannakakis,et al.  Batch sizing and job sequencing on a single machine , 1991 .

[6]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[7]  T. C. Edwin Cheng,et al.  Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times , 2005, Comput. Oper. Res..

[8]  Pavel V. Sevastjanov,et al.  Aggregation of aggregating modes in MCDM: Synthesis of Type 2 and Level 2 fuzzy sets , 2007 .

[9]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[10]  Reha Uzsoy,et al.  Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..

[11]  T. C. Edwin Cheng,et al.  The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan , 2004, Oper. Res. Lett..

[12]  S HochbaumDorit,et al.  Scheduling with batching , 1994 .

[13]  Dorit S. Hochbaum,et al.  Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime , 1997, Oper. Res..

[14]  T. C. Edwin Cheng,et al.  One-machine batching and sequencing of multiple-type items , 1994, Comput. Oper. Res..

[15]  Susanne Albers,et al.  The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..

[16]  Zhaohui Liu,et al.  Scheduling one batch processor subject to job release dates , 2000, Discret. Appl. Math..

[17]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[18]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[19]  Y. H. Kim,et al.  Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals , 2002, Comput. Oper. Res..

[20]  Peter B. Luh,et al.  Steel-making process scheduling using Lagrangian relaxation , 2002 .

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

[22]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

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

[24]  T. C. Edwin Cheng,et al.  On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times , 2003, Oper. Res. Lett..

[25]  B. J. Lageweg,et al.  Computer aided complexity classification of deterministic scheduling problems , 1981 .

[26]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[27]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[28]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..