首页 | 本学科首页   官方微博 | 高级检索  
     


Competitive analysis of preemptive single-machine scheduling
Authors:René   Sitters
Affiliation:
  • Department of Econometrics and Operations Research, VU University, Amsterdam, Netherlands
  • Abstract:We give an online algorithm for minimizing the total weighted completion time on a single machine where preemption of jobs is allowed and prove that its competitive ratio is at most 1.57.
    Keywords:Scheduling   Competitive analysis   Online algorithms
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号