| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142879 | Operations Research Letters | 2010 | 5 Pages |
Abstract
We propose an online algorithm for an economic lot-sizing (ELS) problem with lookahead, which achieves asymptotically optimal worst-case performance for increasing lookahead. Although intuitive, this result is interesting since deterministic algorithms for previously studied online ELS problems have unbounded competitive ratio. We also prove lookahead-dependent lower bounds for deterministic algorithms.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lauri Ahlroth, André Schumacher, Harri Haanpää,