Worst case analysis of Relax and Fix heuristics for lot-sizing problems.

Nabil Absi Wilco van den Heuvel

Published in: Eur. J. Oper. Res. (2019)

Keyphrases

worst case analysis
lot sizing
cutting stock
np hardness
multistage
worst case
average case
mixed integer programming
multi item
bin packing
rolling horizon
lead time
single machine
search algorithm
greedy heuristic
sample size
np hard