Preemptive scheduling to minimize mean weighted flow time

Authors:
J. Y-T. Leung;G. H. Young
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1990

Citing 0
Cited 2

Parallel machine problems with equal processing times: a survey

Journal of Scheduling
Polynomial algorithm for parallel machine mean flow time scheduling problem with release dates

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.89

Visualization

Abstract