Distributed scheduling based on due dates and buffer priorities

Several distributed scheduling policies are analyzed for a large semiconductor manufacturing facility, where jobs of wafers, each with a desired due date, follow essentially the same route through the manufacturing system, returning several times to many of the service centers for the processing of successive layers. It is shown that for a single nonacyclic flow line the first-buffer-first-serve policy, which assigns priorities to buffers in the order that they are visited, is stable, whenever the arrival rate, allowing for some burstiness, is less than the system capacity. The last-buffer-first-serve policy (LBFS), where the priority ordering is reversed, is also stable. The earliest-due-date policy, where priority is based on the due date of a part, as well as another due-date-based policy of interest called the least slack policy (LS), where priority is based on the slack of a part, defined as the due date minus an estimate of the remaining delay, are also proved to be stable