Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 21-36 |
Number of pages | 16 |
Journal | International Journal of Production Research |
Volume | 42 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2004 |
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering