Minimizing total completion time on batch processing machines

Minimizing total completion time on batch processing machines

0.00 Avg rating0 Votes
Article ID: iaor1994612
Country: United Kingdom
Volume: 31
Issue: 9
Start Page Number: 2097
End Page Number: 2121
Publication Date: Sep 1993
Journal: International Journal of Production Research
Authors: , ,
Abstract:

The authors 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 state of semiconductor manufacturing and is expected to occur in other production environments. The authors 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.

Reviews

Required fields are marked *. Your email address will not be published.