Article ID: | iaor1996548 |
Country: | Netherlands |
Volume: | 59 |
Issue: | 2 |
Start Page Number: | 294 |
End Page Number: | 297 |
Publication Date: | Jun 1992 |
Journal: | European Journal of Operational Research |
Authors: | Johri Pravin K. |
Keywords: | programming: dynamic |
Wafer fabrication is a very complex manufacturing process. It is imperative that the mean and the variance of the cycle time be kept small. For the purpose of scheduling, the set of wafer fabrication process steps need to be partitioned into zones of roughly equal sizes, where size refers to the sum of the processing times of the steps in a zone. By formulating the problem as a dynamic program, the paper finds the optimal partition so that the sum of the sequares of the deviations from a target size is minimized.