Minimizing Mean Completion Time in a Batch Processing System

Authors:
Xiaotie Deng;Haodi Feng;Pixing Zhang;Yuzhong Zhang;Hong Zhu
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, Shandong University, Jinan, China;Computer Science Department, University of Toronto, Toronto, Ontario, M5S 1A1, Canada;Qufu Normal University, Qufu, Shandong, China;Department of Computer Science, Fudan University, Shanghai, China
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 5

Scheduling jobs with release dates on parallel batch processing machines

Discrete Applied Mathematics
Short Communication: On scheduling unbounded batch processing machine(s)

Computers and Industrial Engineering
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Scheduling an unbounded batching machine with job processing time compatibilities

Discrete Applied Mathematics
A PTAS for scheduling on agreeable unrelated parallel batch processing machines with dynamic job arrivals

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider batch processing jobs to minimize the mean completion time. A batch processing machine can handle up to $B$ jobs simultaneously. Each job is represented by an arrival time and a processing time. Jobs processed in a batch have the same completion time, i.e., their common starting time plus the processing time of their longest job. For batch processing, non-preemptive scheduling is usually required and we discuss this case. The batch processing problem reduces to the ordinary uniprocessor system scheduling problem if $B=1$. We focus on the other extreme case $B=+\infty$. Even for this seemingly simple extreme case, we are able to show that the problem is NP-hard for the weighted version. In addition, we establish a polynomial time algorithm for a special case when there are only a constant number of job processing times. Finally, we give a polynomial time approximation scheme for the general case.