Minimizing total completion time on batch processing machines

Chandru, V. ; Lee, C. -Y. ; Uzsoy, R. (1993) Minimizing total completion time on batch processing machines International Journal of Production Research, 31 (9). pp. 2097-2121. ISSN 0020-7543

Full text not available from this repository.

Official URL:

Related URL:


We study the problem of minimizing total completion time on single and parallel batch processing machines. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. This problem is motivated by burn-in operations in the final testing stage of semiconductor manufacturing and is expected to occur in other production environments. We provide an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.

Item Type:Article
Source:Copyright of this article belongs to International Foundation for Production Research.
ID Code:5521
Deposited On:19 Oct 2010 12:02
Last Modified:28 May 2011 07:15

Repository Staff Only: item control page