Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study

DOI10.1080/00207540601156215zbMath1154.90383MaRDI QIDQ3605414

Reha Uzsoy, Abhijit Upasani

Publication date: 24 February 2009

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

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

zbMATH Keywords

simulation; job-shop scheduling; rescheduling; decomposition heuristics; global schedules; semiconductor wafer fab scheduling

Mathematics Subject Classification ID

90B30: Production models

Cites Work

• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
• Extending the shifting bottleneck procedure to real-life applications
• Price, delivery time guarantees and capacity selection
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Executing production schedules in the face of uncertainties: a review and some future directions
• A computational study of shifting bottleneck procedures for shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• Finite-capacity production planning algorithms for a semiconductor wafer fabrication facility
• Aggregate order release planning for time-varying demand
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling