A Greedy On-Line Algorithm for the k-Track Assignment Problem

Journal of Algorithms

Volumn 31, Issue 1, 1999, Pages 196-210

  Faigle, U ^a   Kern, W ^a   Nawijn, W M ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Greedy algorithm; Interval order; K track assignment; On line; Scheduling; Time window

Indexed keywords

EID: 0347653511     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.1001     Document Type: Article

References (6)

1. E. M. Arkin and E. B. Silverberg, Scheduling jobs with fixed start and end times, Discrete Appl. Math. 18 (1987), 1-8.
2. P. Brucker and L. Nordmann, The k-track assignment problem, J. Computing 52 (1994), 97-122.
3. M. C. Carlisle and E. L. Lloyd, On the k-coloring of intervals, in "Advances in Computing and Information - ICCI'91," (F. Dehne et al., Eds.), Lecture Notes in Computer Science, Vol. 497, pp. 90-101, Springer-Verlag, New York/Berlin, 1991.
4. U. Faigle and W. M. Nawijn, Note on scheduling intervals on-line, Discrete Appl. Math. 58 (1995), 13-17.
5. M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, The complexity of coloring circular arcs and cords, SIAM J. Algebraic Discrete Methods 1 (1980), 216-227.
6. A. W. J. Kolen and J. K. Lenstra, Interval scheduling, in "Handbook of Combinatorics, Vol. II," (R. Graham et al., Eds.), pp. 1901-1904, Elsevier, Amsterdam, 1995.