Single machine group scheduling with family setups to minimize total tardiness

DOI10.1080/00207540601009976zbMath1160.90398OpenAlexW2101851293MaRDI QIDQ5385473

Jatinder N. D. Gupta, Samarn Chantaravarapan

Publication date: 6 May 2008

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

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

zbMATH Keywords

simulated annealingheuristic algorithmssingle machine schedulingempirical resultsgroup technologyfamily setupsminimizing tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (5)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints

Cites Work

• Optimization by Simulated Annealing
• Evaluation of leading heuristics for the single machine tardiness problem
• A heuristic for the single machine tardiness problem
• Scheduling with batching: A review
• Minimizing Total Tardiness on One Machine is NP-Hard
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: Single machine group scheduling with family setups to minimize total tardiness