Scheduling Related Parallel Batch Processing Machines With Non-Identical Job Sizes And Unequal Ready Times

Abstract

Batch scheduling is widely used in various industries, including burn-in operations within the semiconductor manufacturing sector. This study focuses on the issue of reducing makespan on parallel batch processing machines when dealing with non identical job sizes and arbitrary release times. Given the complexity of this subject matter, I have devised a heuristic approach to effectively address this issue. The proposed methodology involves the development of distance matrix-based methods to create groups, followed by the design of a scheduling technique to allocate these batches to parallel machines. The results of the computational experiments demonstrate that the suggested heuristics exhibit competitiveness in terms of solution quality.