A CP Model for a Scheduling Problem with Limited Secondary Resources Compared to a DES Model

An efficient scheduling of bottleneck areas within the semiconductor manufactory gets more and more important. Due to the high complexity within the manufacturing area it is currently not possible to optimize the whole (or even a big part of the) factory at once. So mostly only work center specific optimization approaches are investigated. Typically scheduling problems only deal with two dimensions – jobs and equipment. But in some areas of semiconductor manufactory also a third dimension has to be considered – a limited secondary resource. In this paper a Constraint Programming model for such limited secondary resource problems is presented. Thereby the scheduling model also deals with setup matrices for the first and also secondary resource. The modeling of this CP model is shown in detail and the results are compared to a discrete event simulation using dispatching rules. The test data for the first tests are orientated on real production data