Sensitivity analysis of priority-based scheduling in manufacturing

We present a perturbation technique for computing sensitivities of schedules with respect to jobs' release times in a manufacturing system. The processing disciplines at the various servers are based on priorities: each job carries its priority code, and when a number of jobs wait in a buffer, the highest-priority one will be served first. Various manufacturing configurations, like generalized flow shops, assembly systems, and job shops are discussed.