Minimizing sum of completion times on a single machine with sequence-dependent family setup times

DOI10.1057/palgrave.jors.2601989zbMath1089.90026OpenAlexW2149085409MaRDI QIDQ5469663

Selçuk Karabatı, Can Akkan

Publication date: 26 May 2006

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.2601989

zbMATH Keywords

Lagrangean relaxationbranch-and-boundsingle machine schedulingfamily setupssum of completion times

Mathematics Subject Classification ID

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

Related Items

ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, A survey of scheduling problems with setup times or costs, Robust scheduling on a single machine to minimize total flow time