Rolling planning horizons: Error bounds for the dynamic lot size model
Mathematics of Operations Research
An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem
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 lot-size model with discrete transportation costs
Computers and Industrial Engineering
Improved algorithms for economic lot size problems
Operations Research
Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
Transportation Science
A Dynamic Lot-Sizing Model with Demand Time Windows
Management Science
Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy
Transportation Science
Two-stage inventory models with a bi-modal transportation cost
Computers and Operations Research
Economic Lot-Sizing for Integrated Production and Transportation
Operations Research
Optimal algorithms for the economic lot-sizing problem with multi-supplier
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A random search heuristic for a multi-objective production planning
Computers and Industrial Engineering
Hi-index | 0.00 |
Motivated by a practical industrial problem where a manufacturer stipulates a minimum order from each buyer but where a local dealer promises the buyer a just-in-time delivery with a slightly higher unit cost, this paper uses a dynamic lot-sizing model with a stepwise cargo cost function and a minimum order amount constraint to help the buyer select the supplier with minimum total cost.