• DocumentCode
    2226083
  • Title

    Minimizing mean flow time with release time and deadline constraints

  • Author

    Du, Jianzhong ; Leung, Joseph Y T

  • Author_Institution
    Comput. Sci. Program, Texas Univ., Dallas, Richardson, TX, USA
  • fYear
    1988
  • fDate
    6-8 Dec 1988
  • Firstpage
    24
  • Lastpage
    32
  • 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 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
  • Keywords
    graph theory; optimisation; scheduling; NP-hard; deadline constraints; greedy algorithm; mean flow time minimisation; optimal schedule; preemptively scheduling; release time; task system; Computer science; Finishing; Greedy algorithms; Optimal scheduling; Processor scheduling; Scheduling algorithm; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems Symposium, 1988., Proceedings.
  • Conference_Location
    Huntsville, AL
  • Print_ISBN
    0-8186-4894-5
  • Type

    conf

  • DOI
    10.1109/REAL.1988.51097
  • Filename
    51097
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2226083