Stochastic online scheduling on parallel machines


Share/Save/Bookmark

Megow, N. and Uetz, M.J. and Vredeveld, T. (2005) Stochastic online scheduling on parallel machines. In: Approximation and Online Algorithms (WAOA 2004), 14-16 September, 2004, Bergen, Norway (pp. pp. 167-180).

[img] PDF
Restricted to UT campus only
: Request a copy
451kB
Abstract:We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic model where jobs with their processing time distributions are known beforehand, we assume that jobs appear one by one, and every job must be assigned to a machine online. We propose a simple online scheduling policy for that model, and prove a performance guarantee that matches the currently best known performance guarantee for stochastic parallel machine scheduling. For the more general model with job release dates we derive an analogous result, and for NBUE distributed processing times we even improve upon the previously best known performance guarantee for stochastic parallel machine scheduling. Moreover, we derive some lower bounds on approximation.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62219
Official URL:http://dx.doi.org/10.1007/11389811_15
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page