Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

DOI10.1080/002075400188843zbMath0944.90529OpenAlexW2143183418MaRDI QIDQ4497287

Cheng-Shuo Wang, Reha Uzsoy

Publication date: 22 August 2000

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075400188843

Mathematics Subject Classification ID

Production models (90B30)

Related Items

Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling ⋮ Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication ⋮ Augmented neural networks for task scheduling. ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ Decomposition methods for reentrant flow shops with sequence-dependent setup times