Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

0.00 Avg rating—0 Votes
Article ID: iaor20084388
Country: Netherlands
Volume: 177
Issue: 1
Start Page Number: 630
End Page Number: 637
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors:
Keywords: optimization
Abstract:

We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine.

Reviews

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