A Two-Echelon Inventory Optimization Model with Demand Time Window Considerations

Authors:
Wikrom Jaruphongsa;Sila Çetinkaya;Chung-Yee Lee
Affiliations:
Department of Industrial and Systems Engineering, National University of Singapore, Singapore;Department of Industrial Engineering, Texas A&M University, College Station, TX, USA;Department of Industrial Engineering and Engineering Management, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Journal of Global Optimization
Year:
2004

Citing 12
Cited 3

Rolling planning horizons: Error bounds for the dynamic lot size model

Mathematics of Operations Research
Optimal common due-data with limited completion time deviation

Computers and Operations Research
An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem

Management Science
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Dynamic lot sizing for multi-echelon distribution systems with purchasing and transportation price discounts

Operations Research
Improved algorithms for economic lot size problems

Operations Research
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs

Management Science
A Dynamic Lot-Sizing Model with Demand Time Windows

Management Science
Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems

Management Science
A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse

Operations Research

Satisfying market demands with delivery obligations or delivery charges

Computers and Operations Research
Capacitated dynamic lot-sizing problem with delivery/production time windows

Operations Research Letters
Dynamic lot-sizing model with demand time windows and speculative cost structure

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a two-echelon dynamic lot-sizing model with demand time windows and early and late delivery penalties. The problem is motivated by third-party logistics and vendor managed inventory applications in the computer industry where delivery time windows are typically specified under a time definite delivery contract. Studying the optimality properties of the problem, the paper provides polynomial time algorithms that require O(T3) computational complexity if backlogging is not allowed and O(T5) computational complexity if backlogging is allowed.