A more efficient formulation of the single machine, static demand, lot scheduling problem

Abstract

The classical assumptions of the economic lot scheduling problem have two main drawbacks. They lead to false cost calculations and the solutions developed under them are often difficult to implement. In this paper, more realistic assumptions are suggested and it is shown that these new assumptions allow a more efficient formulation of the problem. The characteristics of this formulation are studied and it is shown that, for a given production sequence, the model reduces to a continuous linear program with a totally unimodular constraint matrix.