Integrated market selection and production planning: complexity and solution approaches
From MaRDI portal
Publication:715060
DOI10.1007/s10107-011-0441-7zbMath1254.90064OpenAlexW2107869104MaRDI QIDQ715060
Joseph Geunes, Thomas C. Sharkey, O. Erhun Kundakcioglu, H. Edwin Romeijn, Albert P. M. Wagelmans, Wilco van den Heuvel
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0441-7
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Dynamic programming (90C39)
Related Items (7)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Approximation algorithms for supply chain planning and logistics problems with market choice ⋮ On the transportation problem with market choice ⋮ Supply Chain Management with Online Customer Selection ⋮ On a cardinality-constrained transportation problem with market choice ⋮ Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations
Cites Work
- Unnamed Item
- Unnamed Item
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Dynamic pricing and the direct-to-customer model in the automotive industry
- Economic lot-sizing games
- Coordiantion of pricing and multi-period production for constant priced goods
- The theory and practice of revenue management
- The subcoalition-perfect core of cooperative games
- A polynomial time algorithm for a deterministic joint pricing and inventory model
- Coordination of Pricing and Multiple-Period Production Across Multiple Constant Priced Goods
- Joint Production and Pricing Decisions with Setup Costs and Capacity Constraints
- Requirements Planning with Pricing and Order Selection Flexibility
- Inventory and Facility Location Models with Market Selection
- 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
- Improved Algorithms for Economic Lot Size Problems
- The continuous-time single-sourcing problem with capacity expansion opportunities
- Technical Note—Price and Production Decisions with Random Demand
- On the Core of Cost Allocation Games Defined on Location Problems
- Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case
- Price-Production Decisions with Deterministic Demand
- Joint Pricing and Inventory Decisions for Constant Priced Items
- Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case
This page was built for publication: Integrated market selection and production planning: complexity and solution approaches
