Randomized algorithms on parallel machine scheduling

Randomized algorithms on parallel machine scheduling

0.00 Avg rating0 Votes
Article ID: iaor20041549
Country: China
Volume: 25
Issue: 4
Start Page Number: 746
End Page Number: 751
Publication Date: Oct 2002
Journal: Acta Mathematicae Applicatae Sinica
Authors: ,
Abstract:

In this paper, we present randomized algorithms for parallel machine scheduling with objective to maximize the minimum machine completion time. We give a new lower bound for the general m>1 machines case. For m=2, we present best possible randomized algorithms for the on-line version and a semi on-line version with job decreasing processing time.

Reviews

Required fields are marked *. Your email address will not be published.