Performance of decomposition methods for complex workshops under multiple criteria

We evaluate the performance of decomposition procedures for scheduling complex job shops such as semiconductor testing facilities with respect to several different scheduling criteria. We find that schedules developed to minimize maximum lateness also perform well with respect to makespan and total tardiness, and experience only minor degradation in number of tardy jobs.