Decomposition methods for reentrant flow shops with sequence-dependent setup times

✍ Scribed by Ebru Demirkol; Reha Uzsoy

• Publisher: Springer US
• Year: 2000
• Tongue: English
• Weight: 345 KB
• Volume: 3
• Category: Article
• ISSN: 1094-6136
• DOI: 10.1002/(sici)1099-1425(200005/06)3:3<155::aid-jos39>3.0.co;2-e

✦ Synopsis

We consider the problem of scheduling a reentrant #ow shop with sequence-dependent setup times to minimize maximum lateness. We develop a series of decomposition methods (DMs) exploring the importance of components such as subproblem solution method, bottleneck identi"cation and reoptimization method on the solution time/quality tradeo!. Based on these results, we propose an enhanced DM which gives promising results for these di$cult scheduling problems. Our results also yield interesting insights into the strengths and limitations of DMs.