Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

@article{Pandelis2007OptimalPS,
  title={Optimal preemptive scheduling on uniform machines with discounted flowtime objectives},
  author={D. G. Pandelis},
  journal={Eur. J. Oper. Res.},
  year={2007},
  volume={177},
  pages={630-637}
}
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. � 2006 Published by Elsevier B.V. 
4 Citations

References

SHOWING 1-9 OF 9 REFERENCES
Scheduling Independent Tasks on Parallel Processors
  • 225
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
  • 50
  • PDF
A Level Algorithm for Preemptive Scheduling
  • 149
Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
  • 50
Scheduling: Theory, Algorithms, and Systems
  • 6,096
  • PDF
European Journal of Operational Research
  • European Journal of Operational Research
  • 2007
Scheduling: Theory, Algorithms, and Systems, Prentice-Hall
  • New Jersey,
  • 2002
Optimal mean finish time preemptive schedules
  • Optimal mean finish time preemptive schedules
  • 1977
Scheduling of parallel machines with preemptions
  • Scheduling of parallel machines with preemptions
  • 1976