Note—On the Deterministic Demand Multi-Product Single-Machine Lot Scheduling Problem

This note considers two single-machine multi-product scheduling problems with deterministic demand that have appeared in the management science literature: the economic lot scheduling problem and the joint replenishment problem. These problems are shown to be closely related. In addition, they are shown to be nearly identical to a one-warehouse, several-retailer inventory problem. As a consequence, any algorithm which solves one of the problems also solves the other two problems.

• 저널Management Science · 25(3) · 276–280
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.25.3.276
• 저자Stephen C. Graves