Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy

Authors:
Hark-Chin Hwang
Affiliations:
Department of Industrial Engineering, Chosun University, Dong-Gu, Gwangju 501-759, South Korea
Venue:
Transportation Science
Year:
2009

Citing 18
Cited 2

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
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
Lot-sizing with constant batches: formulation and valid inequalities

Mathematics of Operations Research
An O(T3) algorithm for the economic lot-sizing problem with constant capacities

Management Science
Scheduling Trains and Containers with Due Dates and Dynamic Arrivals

Transportation Science
On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures

Operations Research
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures

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
Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach

Transportation Science
Lot-sizing with production and delivery time windows

Mathematical Programming: Series A and B
Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

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

Operations Research Letters
Inventory replenishment model: lot sizing versus just-in-time delivery

Operations Research Letters

Economic Lot-Sizing for Integrated Production and Transportation

Operations Research
Evaluation of Transportation Practices in the California Cut Flower Industry

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective supply system for a vendor-managed inventory (VMI) warehouse requires collaboration between a supplier and a customer, and coordination between production and distribution functions. We study a dynamic lot-sizing model for production and inbound transportation to the VMI warehouse under a policy, based on mutual benefit of the supplier and the customer, that each replenishment quantity should be no less than a predetermined minimum size. To take advantage of economies of scale in replenishment operations as well as in shipment consolidation operations, the problem in this study assumes a concave replenishment cost structure in general for which optimal algorithms are presented. By computational experiments, we show that the most important parameter on the system is the minimum replenishment quantity. We also show that the minimum replenishment policy is successful only when large-size demands are guaranteed based on collaborations.