Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach

We extend past research on the economic lot scheduling problem to address some of the limitations of the earlier work. In particular we develop mixed integer programming formulations with the assumption of a production precedence sequence. When evaluated over a variety of problems from the literature, it is clear that finding a schedule that minimizes costs is not trivial. However, with the use of an effective sequencing heuristic and appropriate formulations, optimal schedules can often be found.