A polynomial time algorithm for a deterministic joint pricing and inventory model
From MaRDI portal
Publication:2572250
DOI10.1016/J.EJOR.2004.06.027zbMath1085.90019OpenAlexW2047773461MaRDI QIDQ2572250
Albert P. M. Wagelmans, Wilco van den Heuvel
Publication date: 16 November 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://repub.eur.nl/pub/929/ERS-2003-065-LIS.pdf
Related Items (15)
Pricing for production and delivery flexibility in single-item lot-sizing ⋮ Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set ⋮ Solving a production-routing problem with price-dependent demand using an outer approximation method ⋮ Optimal ordering and pricing policy for an inventory system with trial periods ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Network flow problems with pricing decisions ⋮ Modeling industrial lot sizing problems: a review ⋮ Dynamic lot-sizing models with pricing for new products ⋮ Joint pricing and inventory management with deterministic demand and costly price adjustment ⋮ Integrated market selection and production planning: complexity and solution approaches ⋮ Multi-item capacitated lot-sizing problems with setup times and pricing decisions ⋮ On the long-run average cost minimization problem of the stochastic production-inventory models ⋮ Capacitated procurement planning with price-sensitive demand and general concave-revenue functions ⋮ The generalized assignment problem with flexible jobs ⋮ Competition under time‐varying demands and dynamic lot sizing costs
Cites Work
- Unnamed Item
- Coordiantion of pricing and multi-period production for constant priced goods
- Dynamic Version of the Economic Lot Size Model
- Coordination of Pricing and Multiple-Period Production Across Multiple Constant Priced Goods
- Deterministic Production Planning: Algorithms and Complexity
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Improved Algorithms for Economic Lot Size Problems
- Price-Production Decisions with Deterministic Demand
- Joint Pricing and Inventory Decisions for Constant Priced Items
This page was built for publication: A polynomial time algorithm for a deterministic joint pricing and inventory model
