@inproceedings{3d61bbda3af24c6bbc10482cd087bbbf,

title = "Minimizing mean flow time with release time and deadline constraints",

abstract = "The problem of preemptively scheduling a task system consisting of a set of n independent tasks on one processor so as to minimize the mean flow time is considered. The goal is to find a preemptive schedule such that the mean flow time is minimized subject to the constraint that each task Ti is executed within the interval between its release time and its deadline. Such a schedule, if it exists, is called an optimal schedule. It is shown that the problem of finding an optimal schedule is NP-hard. A greedy algorithm is given to find an optimal schedule for a large class of task systems.",

author = "Jianzhong Du and Leung, {Joseph Y.T.}",

note = "Copyright: Copyright 2004 Elsevier B.V., All rights reserved.",

year = "1988",

language = "English (US)",

isbn = "0818608943",

series = "Proc Real Time Syst Symp",

publisher = "Publ by IEEE",

pages = "24--32",

booktitle = "Proc Real Time Syst Symp",

}