Parallel Machine Scheduling with Re-entrant Jobs with Consideration of Set up Times

Abstract

We study the identical parallel machine problem with re-entrant jobs. Re-entrant jobs require to pass through the processing line multiple times. In many real-life manufacturing systems with parallel machine environments, one of the scheduling problems that needs to be addressed is the order of jobs on each machine with re-entrant jobs. In addition, manufacturing systems may require periodic maintenance, systematic manufacturing equipment cleaning, or predetermined upper limits on the overtime. Therefore, machine availability may vary during the scheduling horizon. We propose an integer programming model to find the optimal sequence of the re-entrant jobs at parallel machines with consideration of machine availability. The model aims to reduce setup times and maximize capacity utilization by scheduling tasks with similar set up requirements consecutively. We tested the proposed model at a panel line manufacturing company located in Turkey. The order of the panels is scheduled optimally by the proposed model for 3 different instances on the identical parallel machines for the coating process. We also provided relevant information on the user interface we developed to make the proposed scheduling model usable to by the company. The proposed model and interphase offer a systematic approach to panel line planning and can also be implemented in other industries.

Keywords

• Production scheduling
• Re-entrant scheduling
• Parallel machine scheduling
• Sustainable manufacturing
• Integer programming model.

References

1. Kayısoglu, B., Bekli, S., Sahin, A. S., Akyurek, G. G., Aydınlı, R., Copur, S. N., & Ekinci, T. (2024). Parallel machine scheduling with re-entrant jobs with consideration of set up times. The Eurasia Proceedings of Science, Technology, Engineering & Mathematics (EPSTEM), 32, 311-319.