Randomized online algorithms for maximizing busy time interval scheduling

Computing (Vienna/New York)

Volumn 56, Issue 2, 1996, Pages 95-104

  Faigle, U ^a,b   Garbe, R ^a   Kern, W ^a  

^a University of Twente ^*

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Busy time; Interval; Online scheduling; Probabilistic algorithm

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PROBABILITY; RANDOM PROCESSES;

BUSY TIME INTERVAL SCHEDULING; PROBABILISTIC ALGORITHM; RANDOMIZED ONLINE ALGORITHMS;

SCHEDULING;

EID: 0029755922     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02309339     Document Type: Article

References (3)

1. Faigle, U., Nawijn, W. M.: Note on scheduling intervals online. Discrete Appl. Math. 58, 13-18 (1995).
2. Govindan, R., Anderson, D.: Scheduling an IPC mechanisms for continuous media. Technical report, UCB/CSD 91/622, Berkeley, 1992.
3. Lipton, R. J., Tomkins, A.: Online interval scheduling. To appear in: Proceedings symposium on Discrete Algorithms, January 23-25 1995. Arlington, VA.