Mathematical methods for analyzing and optimizing production lines and supply chains in semiconductor industry

摘要

The goal of this paper is to find optimal release dates for products and different manufacturing locations in semiconductor industry. The underlying scheduling problem is solved by constraint programming (CP). Lange [9] describes, that the scheduling problem is too complex to solve it with mixed integer programming and that CP also deals with requirements that makes scheduling complex. All this is applicable in this paper and that is the reason why CP is used. Different objectives are observed and the goodness of the computed suboptimal release dates is tested by a discrete simulation model. For the tests a simplified model of a backend test facility is used. At least the results are compared with dispatching and simulation based methods. All this is done under the aspect of rolling horizon planning.