Abstract:We consider the problem of scheduling jobs on-line on batch processing machines with dynamic job arrivals to minimize makespan. A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on-line algorithms with worst-case ratio ( √ 5 + 1)/2 (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst-case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bounds are given, and two on-line algorithms are presented.

We consider the problem of scheduling jobs on-line on batch processing machines with dynamic job arrivals to minimize makespan. A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on-line algorithms with worst-case ratio ( √ 5 + 1)/2 (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst-case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bounds are given, and two on-line algorithms are presented.