.png){kind=icon}
.png){kind=icon}
Return
A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing
.png){kind=icon}
OA
AI
DOI：10.1080/00207543.2011.575090.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an efficient heuristic algorithm for solving a complex batching and scheduling problem in a diffusion area of a semiconductor plant. Diffusion is frequently the bottleneck in the plant and also one of the most complex areas in terms of number of machines, constraints to satisfy and the large number of lots to manage. The purpose of this study is to investigate an approach to group lots in batches and to schedule these batches on machines. The problem is modelled and solved using a disjunctive graph representation. A constructive algorithm is proposed and improvement procedures based on iterative sampling and Simulated Annealing are developed. Computational experiments, carried out on actual industrial problem instances, show the ability of the iterative sampling algorithms to significantly improve the initial solution, and that Simulated Annealing enhances the results. Furthermore, our algorithm compares favourably to an algorithm reported in the literature for a simplified version of our problem. The constructive algorithm has been embedded in software and is currently being used in a semiconductor plant.
Keywords:
batch scheduling
disjunctive graph
heuristics
semiconductor manufacture
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
View more organizations