Economic lot scheduling

Abstract

A problem of considerable practical importance is that of repetitively scheduling runs or lots of different products on a single facility or machine. Examples are different parts to be worked on a single lathe or different chemicals to be processed in a single reactor. We deal here with the deterministic, steady-state problem where setup times and costs only depend on the next product to be run. This model may seem somewhat rarefied, but it is surprisingly useful in terms of generating benchmark schedules in the real world.

DOI: 10.1145/9327.9333

Cite this paper

@inproceedings{Agnew1986EconomicLS, title={Economic lot scheduling}, author={Robert A. Agnew}, booktitle={APLQ}, year={1986} }