Sensitivity analysis of machine schedules with multi-priority job classes

This paper concerns sensitivity analysis of scheduling in a machine (server) with respect to the jobs´ release times. The various jobs have different priorities which determine their relative order in the buffer. The sensitivity-analysis algorithm is precise and it requires modest computational efforts. It is in the spirit of perturbation analysis (PA) in that it computes a perturbed schedule from the simulation run of a nominal schedule, but it is different from PA in that it does not rely explicitly on the state-transition function, but rather makes use of the priority structure