Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem

DOI10.1007/s40314-016-0370-4zbMath1397.90180MaRDI QIDQ725705

D. Kharzeev

Publication date: 2 August 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-016-0370-4

zbMATH Keywords

branch-and-bound algorithm; integer programming; scheduling; dynamic programming; heuristic algorithm; tardy/lost penalty

Mathematics Subject Classification ID

90C11: Mixed integer programming

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

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming