Priority rules for job shops with weighted tardiness costs
Management Science
The shifting bottleneck procedure for job shop scheduling
Management Science
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems
Journal of Heuristics
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
WSC '05 Proceedings of the 37th conference on Winter simulation
Simulation-based selection of machine criticality measures for a shifting bottleneck heuristic
Proceedings of the 38th conference on Winter simulation
Simulation framework for complex manufacturing systems with automated material handling
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
A multiple criteria decision for trading capacity between two semiconductor fabs
Expert Systems with Applications: An International Journal
Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system
Computers and Operations Research
| Hi-index | 0.00 |
In this paper, we consider distributed versions of a modified shifting bottleneck heuristic for complex job shops. The considered job shop environment contains parallel batching machines, machines with sequence-dependent setup times and reentrant process flows. Semiconductor wafer fabrication facilities are typical examples for manufacturing systems with these characteristics. The used performance measure is total weighted tardiness (TWT). We suggest a two-layer hierarchical approach in order to decompose the overall scheduling problem. The upper (or top) layer works on an aggregated model. Based on appropriately aggregated routes it determines start dates and planned due dates for the jobs within each single work area, where a work area is defined as a set of parallel machine groups. The lower (or base) layer uses the start dates and planned due dates in order to apply shifting bottleneck heuristic type solution approaches for the jobs in each single work area. We conduct simulation experiments in a dynamic job shop environment in order to assess the performance of the heuristic. It turns out that the suggested approach outperforms a pure First In First Out (FIFO) dispatching scheme and provides a similar solution quality as the original modified shifting bottleneck heuristic.