• DocumentCode
    2673684
  • Title

    A 2.5-competitive Online Algorithm for Pm|rj|ΣwjCj

  • Author

    Tao, Jiping ; Jiang, Hao ; Liu, Tundong

  • Author_Institution
    Dept. of Autom., Xiamen Univ., Xiamen, China
  • fYear
    2012
  • fDate
    23-25 May 2012
  • Firstpage
    3184
  • Lastpage
    3188
  • Abstract
    The classical identical machine scheduling problem with the objective of minimizing total weighted completion time is considered in the online setting where jobs arrive over time. An online algorithm is presented and is proven to be (2.5 - 1/2m)-competitive based on the idea of instances reduction.
  • Keywords
    computational complexity; scheduling; 2.5-competitive online algorithm; Pm|rj|ΣwjCj; instances reduction; machine scheduling problem; minimizing total weighted completion time; online setting; Algorithm design and analysis; Job shop scheduling; Optimal scheduling; Parallel machines; Schedules; Single machine scheduling; competitive analysis; identical machine scheduling; online algorithm; total weighted completion time;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2012 24th Chinese
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4577-2073-4
  • Type

    conf

  • DOI
    10.1109/CCDC.2012.6244503
  • Filename
    6244503
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2673684