The stock size problem

DOI10.1287/OPRE.46.3.S1MaRDI QIDQ2781118zbMATH OpenOpenAlexFDO

Authors Hans Kellerer, V. M. Kotov, Franz Rendl, Gerhard J. Woeginger

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

zbMATH Keywords

inventory controlnumerical simulationoptimum stock sizepolynomial time approximation algorithmsscheduling

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1263266
• The complexity of the staggering problem, and other classical inventory problems
• Multicriterion problem in scheduling theory with stockpiling of resources
• Openshop scheduling under linear resources constraints
• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

Cited in

(9)

• How to avoid stockouts when producing several items on a single facility? What to do if you can't?
• 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
• Coordination of production and interstage batch delivery with outsourced distribution
• scientific article; zbMATH DE number 1263266 (Why is no real title available?)
• The alternating stock size problem and the gasoline puzzle
• The alternating stock size problem and the gasoline puzzle
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• On minimizing wiggle in stacked area charts

This page was built for publication: The stock size problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781118)