Open AccessNote—On the Deterministic Demand Multi-Product Single-Machine Lot Scheduling Problem
Author(s) -
Stephen C. Graves
Publication year - 1979
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.25.3.276
Subject(s) - computer science , mathematical optimization , scheduling (production processes) , single machine scheduling , job shop scheduling , operations research , mathematics , schedule , operating system
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.inventory/production, inventory/production: packaging, inventory/production: deterministic models