A simulation optimization framework to solve Stochastic Flexible Job-Shop Scheduling Problems—Case: Semiconductor manufacturing
Методология оптимизации на основе имитационного моделирования для решения стохастических задач гибкого расписания работ в цехе: пример производства полупроводников
2023-12-05
SCID: 54.1/rqpucje5
Discuss with AI
genetic algorithmphotolithography workstationsemiconductor manufacturingsimulation optimizationstochastic flexible job-shop scheduling
Figures from the paper
Abstract (AI)
This paper addresses a Stochastic Flexible Job-Shop Scheduling Problem (SFJSSP) in the context of semiconductor manufacturing. Semiconductor industry is among the most capital-intensive businesses whose operational excellence is of vital importance. Within the front-end fab of the semiconductor industry, the photolithography workstation is the well-known bottleneck process. To elevate the performance of the whole semiconductor manufacturing system, developing a competent schedule for its bottleneck is essential. However, the re-entrant product flows, high uncertainties in operations times, and rapidly changing products and technologies within the photolithography, make it difficult to develop a schedule for the whole semiconductor fab. Considering Industry 4.0, hybrid methods such as Simulation Optimization (SO) have proven their applicability in addressing complex production scheduling problems. Thus, this paper develops a mathematical model for SFJSSP of the semiconductor manufacturing considering special constraints of the photolithography workstation (machine process capability, machine dedication, and maximum reticles (masks) sharing constraints). Next, we transform the developed model into an SO model integrated with a computer simulation model capable of modeling the photolithography workstation. The simulation model develops an initial schedule based on the Least Work Remaining (LWR) dispatching rule. Moreover, the simulation model calculates the objective function of the SFJSSP. A tailored Genetic Algorithm (GA) is then developed, which attempts to optimize the initially proposed schedule. To validate the superiority of the presented SO methodology in addressing SJSSPs, it is compared with previously proposed methods. Furthermore, to assess the impact of the three special constraints of the photolithography work area on system performance, two sets of experiments are proposed. In the first set of experiments, the performance of two SFJSS environments, one with the special constraints and one without, is compared. The second set of experiments involves observing the system’s performance while systematically varying the severity of the special constraints. The results indicate that improved performance levels can be accomplished by enhancing flexibility within both the operations of individual jobs and the machines within the manufacturing system.
Key Findings
1
A stochastic flexible job-shop scheduling model is developed for semiconductor photolithography, incorporating process capability, machine dedication, and maximum reticle-sharing constraints.
2
A tailored Genetic Algorithm is developed within the simulation-optimization framework to improve the initial photolithography schedule under operational uncertainty.
3
The framework is designed to address re-entrant flows, uncertain operation times, and rapidly changing products and technologies in semiconductor manufacturing.
4
The model is integrated with a computer simulation that generates an initial schedule using the Least Work Remaining dispatching rule and evaluates the scheduling objective.
5
The study compares the proposed simulation-optimization methodology with previously proposed methods and evaluates the performance impact of the three photolithography-specific constraints.
Research Object
the photolithography workstation in the front-end semiconductor fabrication plant
Research Subject
stochastic flexible job-shop scheduling performance under machine process capability, machine dedication, and maximum reticle-sharing constraints
Publication Details
Publication Date
2023-12-05
Journal
Publisher
ISSN
Cited by
47
Open access PDF
Access Type
Author Information
Download PDF
Subscribe to digest