Decomposition and simplification of scheduling model for manufacturing semiconductors

A scheduling model with the objective of minimizing the average WIP (work in process) level is built based on the fluid network model of semiconductor manufacturing systems. Taking advantage of the characteristic of its decomposition, the scheduling scheme is divided into a series of subareas with the same length. The original scheduling problem is then decomposed into subproblems in each subarea. The solution can be obtained by summing the solutions of these subproblems. The computational complexity of the algorithm is proportional to the scheduling scheme. The improvement in performance and efficiency is shown by an example.