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

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

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

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1504/ijor.2010.034069

zbMATH Keywords

earlinessbranch-and-boundtardinessjust-in-timesingle machine schedulingJIT production

Mathematics Subject Classification ID

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

Related Items (1)

Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness

This page was built for publication: A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine