《2016 A distributed shifting bottleneck heuristic for complex job shops》.pdf

Computers Industrial Engineering 49 (2005) 363–380 /locate/dsw A distributed shifting bottleneck heuristic for complex job shops* ¨ a,* ´ b Lars Monch , Rene Drießel aInstitute of Information Systems, Technical University of Ilmenau, Helmholtzplatz 3, 98684 Ilmenau, Germany bX-CASE GmbH, Albert Einstein Str. 3, 98684 Ilmenau, Germany Received 20 October 2004; revised 13 May 2005; accepted 6 June 2005 Available online 12 September 2005 Abstract 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