Inventory replenishment model: lot sizing versus just-in-time delivery.
From MaRDI portal
Publication:703285
DOI10.1016/j.orl.2003.12.008zbMath1054.90010OpenAlexW2085941933MaRDI QIDQ703285
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.12.008
Related Items (13)
Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs ⋮ Efficient algorithms for the joint replenishment problem with minimum order quantities ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ Modeling industrial lot sizing problems: a review ⋮ Lot sizing with minimum order quantity ⋮ Dynamic lot-sizing problem with demand time windows and container-based transportation cost ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities ⋮ Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures ⋮ An FPTAS for SM‐CELS problem with monotone cost functions ⋮ A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows ⋮ Two-stage inventory models with a bi-modal transportation cost
Cites Work
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Dynamic Version of the Economic Lot Size Model
- A Dynamic Lot-Sizing Model with Demand Time Windows
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- 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
- Improved Algorithms for Economic Lot Size Problems
- Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
- Optimal outbound dispatch policies: Modeling inventory and cargo capacity
- Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Optimal Inventory Policy with Multiple Set-Up Costs
This page was built for publication: Inventory replenishment model: lot sizing versus just-in-time delivery.
