论文信息 - Scheduling one batch processor subject to job release dates

Scheduling one batch processor subject to job release dates

In this paper, we consider the problem of scheduling jobs with release dates on a single-batch processor in order to minimize the makespan. This problem is proved to be NP-hard even for the case with two distinct release dates. Then a pseudopolynomial algorithm is presented for the case with a fixed number of release dates. Finally, a greedy heuristic for the general problem is shown to have the best-performance bound 2.

Zhaohui Liu | Wenci Yu | Zhaohui Liu | W. Yu

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

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

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

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

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

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