Jobs with random processing times, random due dates, and weights are to be scheduled on parallel machines so as to minimize the expected total weight of tardy jobs. Under various assumptions, optimal policies are presented both for static lists and dynamic schedules, preemptive and nonpreemptive.
No takes yet. Share an insight, caveat, or question.
Emmons et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: