Competitive analysis of preemptive single-machine scheduling

被引:10
|
作者
Sitters, Rene [1 ]
机构
[1] Vrije Univ Amsterdam, Dept Econometr & Operat Res, Amsterdam, Netherlands
关键词
Scheduling; Competitive analysis; Online algorithms;
D O I
10.1016/j.orl.2010.08.012
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:585 / 588
页数:4
相关论文
共 50 条
  • [21] Single-machine scheduling with learning considerations
    Biskup, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 115 (01) : 173 - 178
  • [22] SCHEDULING GROUPS OF JOBS ON A SINGLE-MACHINE
    WEBSTER, S
    BAKER, KR
    OPERATIONS RESEARCH, 1995, 43 (04) : 692 - 703
  • [23] Single-machine scheduling with nonlinear deterioration
    Ji-Bo Wang
    Ming-Zheng Wang
    Optimization Letters, 2012, 6 : 87 - 98
  • [24] Single-machine scheduling with supporting tasks
    Kononov, Alexander V.
    Lin, Bertrand M. T.
    Fang, Kuei-Tang
    DISCRETE OPTIMIZATION, 2015, 17 : 69 - 79
  • [25] Single-machine scheduling with learning considerations
    Fac. of Econ. and Bus. Admin., Univ. Bielefeld, Postfach 10 01 31, 33501 Bielefeld, Germany
    Eur J Oper Res, 1 (173-178):
  • [26] Single-machine scheduling with deteriorating jobs
    Kuo, Wen-Hung
    Yang, Dar-Li
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2012, 43 (01) : 132 - 139
  • [27] Single-machine scheduling with learning functions
    Wang, Ji-Bo
    Wang, Dan
    Zhang, Guo-Dong
    APPLIED MATHEMATICS AND COMPUTATION, 2010, 216 (04) : 1280 - 1286
  • [28] Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
    Tadayon, Bita
    Smith, J. Cole
    JOURNAL OF SCHEDULING, 2015, 18 (06) : 575 - 592
  • [29] ANALYSIS OF A LINEARIZATION HEURISTIC FOR SINGLE-MACHINE SCHEDULING TO MAXIMIZE PROFIT
    FISHER, ML
    KRIEGER, AM
    MATHEMATICAL PROGRAMMING, 1984, 28 (02) : 218 - 225
  • [30] Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
    Bita Tadayon
    J. Cole Smith
    Journal of Scheduling, 2015, 18 : 575 - 592