Minimizing L max for the single machine scheduling problem with family set-ups

DOI10.1080/00207540410001716561zbMath1060.90046OpenAlexW1985556167MaRDI QIDQ4671323

Thom J. Hodgson, Russell E. King, Mehmet R. Taner, Simon R. Schultz

Publication date: 26 April 2005

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

A survey of scheduling problems with setup times or costs ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ A simulated annealing algorithm for single machine scheduling problems with family setups

Cites Work

• Unnamed Item
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Minimizing maximum lateness with job families
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Scheduling Groups of Jobs on a Single Machine