ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Minimizing total completion time on batch processing machines

Chandru, V and Lee, CY and Uzsoy, R (1993) Minimizing total completion time on batch processing machines. In: International Journal of Production Research, 31 (9). pp. 2097-2121.

Full text not available from this repository.
Official URL: http://www.informaworld.com/smpp/content~db=all~co...

Abstract

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: Journal Article
Additional Information: Copyright of this article belongs to Taylor and Francis Group.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 17 Feb 2011 06:45
Last Modified: 17 Feb 2011 06:45
URI: http://eprints.iisc.ernet.in/id/eprint/35614

Actions (login required)

View Item View Item