On-line scheduling with delivery time on a single batch machine

We consider a single batch machine on-line scheduling problem with jobs arriving over time. A batch processing machine can handle up to B jobs simultaneously as a batch, and the processing time for a batch is equal to the longest processing time among the jobs in it. Each job becomes available at its arrival time, which is not known in advance, and its characteristics, such as processing time and delivery time, become known at its arrival. Once the processing of a job is completed we deliver it to the destination. The objective is to minimize the time by which all jobs have been delivered. In this paper, we deal with two variants: the unbound model where B is sufficiently large and the bounded model where B is finite. We provide on-line algorithms with competitive ratio 2 for the unbounded model and with competitive ratio 3 for the bounded model. For when each job has the same processing time, we provide on-line algorithms with competitive ratios (5+1)/2, and these results are the best possible.

[1]  Yuzhong Zhang,et al.  Approximation Algorithms in Batch Processing , 1999, ISAAC.

[2]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[3]  Xiaoqiang Cai,et al.  On‐line algorithms for minimizing makespan on batch processing machines , 2001 .

[4]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[5]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[6]  Chung Keung Poon,et al.  On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity , 2005, J. Comb. Optim..

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

[8]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[10]  Reha Uzsoy,et al.  A review of production planning and scheduling models in the semiconductor industry , 1994 .

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

[12]  H. Mine,et al.  PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES , 1979 .

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

[14]  Han Hoogeveen,et al.  A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine , 2000, SIAM J. Discret. Math..