Chandru, Vijaya and Lee, Chung-Yee and Uzsoy, Reha (1993) Minimizing total completion time on a batch processing machine with job families. In: Operations Research Letters, 13 (2). pp. 61-65.
Full text not available from this repository. (Request a copy)Abstract
We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry
| Item Type: | Journal Article |
|---|---|
| Publication: | Operations Research Letters |
| Publisher: | Elsevier Science |
| Additional Information: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | scheduling;batch processing machines;dynamic programming; semiconductor manufacturing. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 17 Feb 2011 06:50 |
| Last Modified: | 17 Feb 2011 06:50 |
| URI: | http://eprints.iisc.ac.in/id/eprint/35613 |
Actions (login required)
 |
View Item |
