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.
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=9333.