| Article ID: | iaor1992948 |
| Country: | Netherlands |
| Volume: | 47 |
| Issue: | 1 |
| Start Page Number: | 49 |
| End Page Number: | 55 |
| Publication Date: | Jul 1990 |
| Journal: | European Journal of Operational Research |
| Authors: | Pinedo Michael, Emmons Hamilton |
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.