The Stock Size Problem
From MaRDI portal
Publication:2781118
DOI10.1287/opre.46.3.S1zbMath0987.90007OpenAlexW2051782734MaRDI QIDQ2781118
Gerhard J. Woeginger, Vladimir Kotov, Hans Kellerer, Franz Rendl
Publication date: 1 July 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.3.s1
schedulingnumerical simulationinventory controlpolynomial time approximation algorithmsoptimum stock size
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (4)
Coordination of production and interstage batch delivery with outsourced distribution ⋮ Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity ⋮ Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems
This page was built for publication: The Stock Size Problem
