Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

DOI10.1007/s10951-006-0325-5zbMath1154.90491OpenAlexW1989570164MaRDI QIDQ880579

Karthik Sourirajan, Reha Uzsoy

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-0325-5

zbMATH Keywords

Computational evaluationJob shop schedulingMaximum latenessShifting bottleneck

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Job scheduling of diffusion furnaces in semiconductor fabrication facilities ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times ⋮ Scheduling Algorithms for Single Machine Problem with Release and Delivery Times ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The one-machine sequencing problem
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Executing production schedules in the face of uncertainties: a review and some future directions
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Scheduling batch processing machines with incompatible job families
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Experimental evaluation of heuristic optimization algorithms: A tutorial