A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
From MaRDI portal
Publication:339632
DOI10.1016/j.cor.2012.03.004zbMath1349.90364MaRDI QIDQ339632
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.004
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research