Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
From MaRDI portal
Publication:3100450
DOI10.1287/opre.1080.0662zbMath1226.90141OpenAlexW2132027865MaRDI QIDQ3100450
Albert P. M. Wagelmans, Wilco van den Heuvel
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3ecbb7c75f4a0d4bd6ab848f36814d1063e45f85
analysis of algorithmsproduction/scheduling: planninginventory/production: approximations/heuristics
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (16)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem ⋮ Convex duality and calculus: Reduction to cones ⋮ Online ordering policies for a two-product, multi-period stationary newsvendor problem ⋮ On the power of lookahead in online lot-sizing ⋮ An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Probability-free solutions to the non-stationary newsvendor problem ⋮ Supply Chain Management with Online Customer Selection ⋮ Online lot-sizing problems with ordering, holding and shortage costs ⋮ Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand ⋮ A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters ⋮ Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Online economic ordering problem for deteriorating items with limited price information
This page was built for publication: Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
