On-line bicriteria interval

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 312-322

  Baille, Fabien ^a   Bampis, Evripidis ^a   Laforest, Christian ^a   Thibault, Nicolas ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; SCHEDULING;

COMPETITIVE RATIOS; MONOCRITERIAL ON-LINE ALGORITHMS; ON-LINE BICRITERIAL INTERVALS;

ONLINE SYSTEMS;

EID: 27144503447     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_36     Document Type: Conference Paper

References (8)

1. E. ARKIN AND B. SILVERBERG, Scheduling jobs with fixed start and end times, Discrete Applied Mathematics, 18 (1987), pp. 1-8.
2. F. BAILLE, E. BAMPIS, AND C. LAFOREST, A note on bicriteria schedules with optimal approximation ratios, Parallel Processing Letters, 14 (2004), pp. 315-323.
3. A. BAR-NOY, R. CANETTI, S. KUTTEN, Y. MANSOUR, AND B. SCHIEBER, Band-width allocation with preemption, SIAM J. Comput., 28 (1999), pp. 1806-1828.
4. A. BORODIN AND R. EL-YANIV, Online computation and competitive analysis, Cambridge University press, 1998.
5. M. C. CARLISLE AND E. L. LLOYD, On the k-coloring of intervals, Discrete Applied Mathemetics, 59 (1995), pp. 225-235.
6. U. FAIGLE AND M. NAWIJN, Note on scheduling intervals on-line, Discrete Applied Mathematics, 58 (1995), pp. 13-17.
7. A. FIAT AND G. J. WOEGINGER, Online algorithms: The state of the art, LNCS no. 1442, Springer, 1998.
8. G. J. WOEGINGER, On-line scheduling of jobs with fixed start and end times, Theor. Comput. Sci., 130 (1994), pp. 5-16.