Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness

DOI10.1016/j.ejor.2008.07.005zbMath1157.90425OpenAlexW2018828072MaRDI QIDQ1011327

Jeffrey E. Schaller

Publication date: 8 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.005

zbMATH Keywords

schedulingparallel machinesbranch-and-boundlower bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates

Cites Work

• Scheduling on parallel identical machines to minimize total tardiness
• Minimizing total tardiness in permutation flowshops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness