Minimizing total tardiness in an unrelated parallel-machine scheduling problem

DOI10.1057/palgrave.jors.2602141zbMath1125.90024OpenAlexW2009709627MaRDI QIDQ5428943

Yeong-Dae Kim, Sang-Oh Shim

Publication date: 29 November 2007

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602141

zbMATH Keywords

schedulingbranch and boundunrelated parallel machinestotal tardiness

Mathematics Subject Classification ID

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

Related Items (8)

Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

This page was built for publication: Minimizing total tardiness in an unrelated parallel-machine scheduling problem