No abstract

The purpose of this paper is to show how the results of an optimisation model that can be integrated with the decisions made within a simulation model to schedule back-end operations in a semiconductor assembly and test facility. The problem is defined by a set of resources that includes machines and tooling, process plans for each product and the following four hierarchical objectives: minimise the weighted sum of key device shortages, maximise weighted throughput, minimise the number of machines used and minimise the makespan for a given set of lots in queue. A mixed integer programming model is purposed and first solved with a greedy randomised adaptive search procedure (GRASP). The results associated with the prescribed facility configuration are then fed to the simulation model written in AutoSched AP. However, due to the inadequacy of the options built into AutoSched, three new rules were created: the first two are designed to capture the machine set-up profiles provided by the GRASP and the third to prioritise the processing of hot lots containing key devices. The computational analysis showed that incorporating the set-up from the GRASP in dynamic operations of the simulation greatly improved its performance with respect to the four objectives.

No abstract

No abstract

No abstract