Worst-case analysis for a general class of online lot-sizing heuristics

Worst-case analysis for a general class of online lot-sizing heuristics

0.00 Avg rating0 Votes
Article ID: iaor20101085
Volume: 58
Issue: 1
Start Page Number: 59
End Page Number: 67
Publication Date: Jan 2010
Journal: Operations Research
Authors: ,
Keywords: heuristics
Abstract:

In this paper, we analyze the worst-case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of online heuristics that is often applied in a rolling-horizon environment. We develop a procedure to systematically construct worst-case instances for a fixed time horizon and use it to derive worst-case problem instances for an infinite time horizon. Our analysis shows that any online heuristic has a worst-case ratio of at least 2.

Reviews

Required fields are marked *. Your email address will not be published.