Simulating Stochastic Scheduling Policies on Unrelated Machines

Bontekoe, T.H. (2017) Simulating Stochastic Scheduling Policies on Unrelated Machines.

[img]
Preview
PDF
275kB
Abstract:We investigate the competitive performance bounds of a purely combinatorial, online algorithm for stochastic and non-preemptive scheduling on unrelated machines. Several simulation experiments with different instances are executed and the performance is investigated froma computational perspective. The performance of this online algorithm is compared to an offline LP relaxation based algorithm and the WSEPT rule, both on average and in worst case. Finally, the random LP-relaxation based policy is derandomized and the effects on the performance of this algorithm are investigated.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:31 mathematics
Programme:Applied Mathematics BSc (56965)
Link to this item:http://purl.utwente.nl/essays/72776
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page