Capacity expansion planning for a single facility product line
From MaRDI portal
Publication:795708
DOI10.1016/0377-2217(84)90257-1zbMath0542.90032OpenAlexW2056412471MaRDI QIDQ795708
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90257-1
polynomial algorithmoptimal policieslogisticssingle facilitydeterministic multiperiod capacity expansion modelmany products
Applications of mathematical programming (90C90) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (3)
Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales ⋮ A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints ⋮ A model for the optimal timing and sizing of capacity increments for single-location facilities
Cites Work
- On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs
- Production planning with time-dependent capacity bounds
- Dynamic Version of the Economic Lot Size Model
- A multifacility capacity expansion model with joint expansion set-up costs
- Deterministic Production Planning: Algorithms and Complexity
- Operations Research and Capacity Expansion Problems: A Survey
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
This page was built for publication: Capacity expansion planning for a single facility product line
