Analysis of a class of real-time multiproduct lot scheduling policies

A single machine processing different types of parts is considered. Switching from one type to another involves a setup time. The part types may have different processing times. The resulting scheduling problem is treated as a dynamical system for which several feedback policies that are implementable in real time and that stabilize the system are discussed. The main results are a characterization of the dynamics induced by clear-the-largest-work policies and the derivation of bounds on the total work-in-process which are better than those available in the literature