An effective algorithm for the capacitated single item lot size problem
From MaRDI portal
Publication:1331619
DOI10.1016/0377-2217(94)90086-8zbMath0806.90054OpenAlexW1995168503MaRDI QIDQ1331619
James Flynn, Chia-Shin Chung, Chien-Hua Mike Lin
Publication date: 21 August 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90086-8
dynamic programmingbranch-and-boundNP-harddeterministic, single product capacitated dynamic lot size modelgrowth constraint
Related Items (8)
Capacitated lot size problems with fuzzy capacity ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ Lot sizing with bounded inventory and lost sales ⋮ Single item lot sizing problems ⋮ Dynamic optimization for coordinated replenishment system considering seasonal demand and price quantity discount
Cites Work
- Unnamed Item
- A capacity constrained singlefacility dynamic lot-size model
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Extreme points of Leontief substitution systems
- Dynamic Version of the Economic Lot Size Model
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- A Dynamic Lot-Size Model with Make-or-Buy Decisions
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- Computational Complexity of the Capacitated Lot Size Problem
- 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
- Planning Horizons for the Dynamic Lot Size Model with Backlogging
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Planning Horizons for Production Smoothing with Deterministic Demands
- General Planning Horizons for Production Smoothing with Deterministic Demands
- Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
- 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: An effective algorithm for the capacitated single item lot size problem
