Abstract
At each major iteration, the shifting bottleneck heuristic for job shop scheduling requires the solution of several subproblems - one for each currently unscheduled toolgroup. We discuss an effort to provide a library of subproblem solution procedures for use in a modified shifting-bottleneck heuristic that has been customized for the semiconductor wafer fabrication problem. These procedures are tailored to the toolgroups commonly encountered in wafer fab. We outline the main categories of subproblems encountered in this setting and the corresponding algorithms employed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-4 |
| Number of pages | 4 |
| Journal | Technical Paper - Society of Manufacturing Engineers. MF |
| Issue number | MF02-269 |
| State | Published - Dec 1 2002 |
Keywords
- Scheduling
- Semiconductor manufacturing
- Shifting bottlenecks heuristic
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering