Scheduling parallel batch processing machines: A case study in the semiconductor industry

Authors : Şeyda Topaloğlu Yıldız, Ezgi Güleç

Pages : 90-105

Doi:10.56554/jtom.1260796

View : 42 | Download : 41

Publication Date : 2024-07-18

Article Type : Research Paper

Abstract :This paper presents a mathematical programming-based solution approach for the scheduling problem of batch-processing parallel machines with eligibility constraints. A case study has been presented in the semiconductor industry, where the ovens are scheduled for the underfill cure operation of products. The case includes constraints, such as oven-product eligibility restrictions, loading constraints for the batching of products for ovens, daily production requirements, and oven capacity constraints. In this study, we also assess the difference between creating batches of a single product type or different product types to be allocated to the ovens. The case study results have shown that the proposed models, in comparison to the current situation, increase the occupancy rate of ovens. The execution of the models aids the company in gaining visibility on the scheduling of ovens and successfully managing the production plan and order commitment. The proposed models have been effective and supportive of the semiconductor company.
Keywords : batch processing, scheduling, parallel machines, mixed integer programming, case study

ORIGINAL ARTICLE URL