A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A set of n independent jobs is to be scheduled without preemption on m identical parallel machines. For each job j, a diffuse adversary chooses the distribution F j of the random processing time P j from a certain class of distributions F j . The scheduler is given the expectation µ j = E[P j ], but the actual duration is not known in advance. A positive weight w j is associated with each job j and all jobs are ready for execution at time zero. The scheduler determines a list of the jobs, whichdoi:10.1007/s00224-005-1261-z fatcat:7g4l2tmucfexfbelkkrodlgk64