On-line scheduling revisited

被引：1
|
作者：
Fleischer, Rudolf
Wahl, Michaela
机构：
[1] Department of Computer Science, University of Waterloo, Waterloo, Ont. N2L 3G1, Canada
[2] Max-Planck-Inst. für Informatik, Saarbrücken, Germany
来源：
Journal of Scheduling | 2000年 / 3卷 / 06期
关键词：
D O I：
10.1002/1099-1425(200011/12)3:63.0.CO;2-2
中图分类号：
学科分类号：
摘要：
21
引用
收藏
页码：343 / 353
相关论文
共 50 条
  • [1] On-line scheduling to minimize average completion time revisited
    Megow, N
    Schulz, AS
    OPERATIONS RESEARCH LETTERS, 2004, 32 (05) : 485 - 490
  • [2] On-line scheduling
    Sgall, J
    ONLINE ALGORITHMS: THE STATE OF THE ART, 1998, 1442 : 196 - 231
  • [3] Scheduling to minimize average completion time revisited: Deterministic on-line algorithms
    Megow, N
    Schulz, AS
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 227 - 234
  • [4] On-line partitioning for on-line scheduling with resource conflicts
    Borowiecki, Piotr
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 981 - 990
  • [5] On-line service scheduling
    Wang, Zhenbo
    Xing, Wenxun
    Chen, Bo
    JOURNAL OF SCHEDULING, 2009, 12 (01) : 31 - 43
  • [6] On-line service scheduling
    Zhenbo Wang
    Wenxun Xing
    Bo Chen
    Journal of Scheduling, 2009, 12 : 31 - 43
  • [7] Configurable on-line scheduling
    Chiodini, V
    INTEGRATED COMPUTER-AIDED ENGINEERING, 1996, 3 (04) : 225 - 243
  • [8] ON-LINE SCHEDULING OF EMPTY CONTAINERS
    Zhang, Lele
    Wirth, Andrew
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2012, 29 (04)
  • [9] On-line scheduling with precedence constraints
    Azar, Y
    Epstein, L
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 164 - 174
  • [10] On-line scheduling with setup costs
    Gambosi, G
    Nicosia, G
    INFORMATION PROCESSING LETTERS, 2000, 73 (1-2) : 61 - 68
12345