A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

DOI10.1504/IJOR.2010.034069zbMath1198.90197MaRDI QIDQ604766

Amir Azaron, Ghasem Moslehi, Mehdi Mahnam, Majid Amin-Nayeri

Publication date: 12 November 2010

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

zbMATH Keywords

earliness; branch-and-bound; tardiness; just-in-time; single machine scheduling; JIT production

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research