A two-echelon inventory optimization model with demand time window considerations
From MaRDI portal
Publication:2574100
DOI10.1007/s10898-004-6092-yzbMath1082.90003MaRDI QIDQ2574100
Chung-Yee Lee, Sıla Çetinkaya, Wikrom Jaruphongsa
Publication date: 16 November 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-6092-y
Related Items
Satisfying market demands with delivery obligations or delivery charges, An efficient procedure for dynamic lot-sizing model with demand time windows, Vendor managed inventory model for single-vendor multi-retailer supply chains, Dynamic lot-sizing problem with demand time windows and container-based transportation cost, Dynamic lot-sizing model with demand time windows and speculative cost structure
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal common due-date with limited completion time deviation
- The pickup and delivery problem with time windows
- Determination of common due window location in a single machine scheduling problem
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Earliness-tardiness scheduling problems with a common delivery window
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- A Dynamic Lot-Sizing Model with Demand Time Windows
- Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- 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
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- 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
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Bounded Production and Inventory Models with Piecewise Concave Costs
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Improved Algorithms for Economic Lot Size Problems
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
