Article ID: | iaor1993987 |
Country: | Netherlands |
Volume: | 12 |
Issue: | 2 |
Start Page Number: | 101 |
End Page Number: | 109 |
Publication Date: | Aug 1992 |
Journal: | Operations Research Letters |
Authors: | Gupta Diwakar |
Keywords: | programming: travelling salesman |
This paper presents an analysis of the single machine economic lot scheduling problem when all of the items that the machine is required to produce are constrained to have a common production cycle. Globally optimal lot sizes and maximum backorder levels are derived for the situation when backlogging of unsatisfied demand is permitted. Numerical examples suggest that overall cost of the scheduling problem can be reduced by allowing temporary shortages of some items.