Heuristics for minimizing total weighted tardiness in complex job shops

DOI10.1080/00207540412331331399zbMath1090.90088OpenAlexW2132101809MaRDI QIDQ4681151

John W. Fowler, W. Matthew Carlyle, Douglas C. Montgomery, Scott J. Mason

Publication date: 14 June 2005

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

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

zbMATH Keywords

integer programmingschedulingheuristicshifting bottleneck

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ 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
• Scheduling jobs on parallel machines with sequence-dependent setup times
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The use of upstream and downstream information in scheduling semiconductor batch operations
• Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study

This page was built for publication: Heuristics for minimizing total weighted tardiness in complex job shops