Learn More
In this research, we model a semiconductor wafer fabrication process as a complex job shop, and adapt a Modified Shifting Bottleneck Heuristic (MSBH) to facilitate the multi-criteria optimization of makespan, cycle time, and total weighted tardiness using a desirability function. The desirability function is implemented at two different levels of the MSBH:(More)
This paper describes how a large number of products are scheduled to run in parallel on a pool of wire-bond machines to meet weekly demand. We seek to maximize demand fulfillment subject to system constraints. The schedule is generated by a simulation engine and used to control the machines at execution time and also to plan for the start of material. By(More)
This paper considers a complex job shop problem with re-entrant flow and batch processing machines. A modified shifting bottleneck heuristic (MSB) is considered for generating machine schedules to minimize the total weighted tardiness. We observe that the MSB could produce infeasi-ble schedules where cyclic schedules are found. A cycle elimination procedure(More)
Many companies utilize a number of complex product distribution networks to transport various types of goods. Most of their distribution networks consist of transporting goods from their suppliers to their Distribution Centers (DCs). In the process of transporting goods from suppliers to DCs, cross docking facilities are utilized to consolidate loads in(More)
The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is motivated by scheduling the wafer fabrication phase of 300-mm semiconductor manufacturing, as it contains both batch processing operations and multiple customer orders being grouped(More)