An Optimal Static Priority Rule for Stochastic Scheduling with Impatience
Résumé
In this paper we discuss scheduling problems with impatience to the beginning and to the end of service. The impatience of a job can be seen as a due date and processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling policies. We derive optimal schedules when processing times and due dates are exponentially distributed.