On-line time-constrained scheduling problem for the size on k machines

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn 2005, Issue , 2005, Pages 20-24

  Thibault, Nicolas ^a   Laforest, Christian ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

INPUT SEQUENCES; OLUW; SCHEDULING PROBLEMS;

ONLINE SYSTEMS;

EID: 33846995960     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2005.65     Document Type: Conference Paper

References (12)

1. R. Adler and Y. Azar. Beating the logarithmic lower bound: Randomized preemptive disjoint paths and call control algorithms. Journal of Scheduling, 6(2): 113-129, 2003.
2. F. Baille, E. Bampis, C. Laforest, and N. Thibault. On-line bicriteria interval scheduling. In Euro-Par, 2005.
3. F. Baille, E. Bampis, C. Laforest, and N. Thibault. On-line simultaneous maximization of the size and the weight for degradable intervals schedules. In COCOON, 2005.
4. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. SIAM J. Comput, 28(5):1806-1828, 1999.
5. A. Bar-Noy, G. S., N. J., and S. B. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31:331-352, 2001.
6. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University press, 1998.
7. U. Faigle and W. Nawijn. Note on scheduling intervals on-line. Discrete Applied Mathematics, 58(58):13-17, 1994.
8. J. Garay, J. Naor, B. Yener, and P. Zhao. On-line admission control and packet scheduling with interleaving. In Proceedings of INFOCOM, pages 94-103, 2002.
9. J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. Journal of Algorithms, 23(1):180-194, 1997.
10. M. H. Goldwasser. Patience is a virtue: the effect of slack on competitiveness for admission control. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, pages 396-405, 1999.
11. J. S. Naor, A. Rosen, and G. Scalosub. Online time-constrained scheduling in linear networks. In Proceedings of INFOCOM, 2005.
12. G. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoritical Computer Science, 130(130):5-16, 1994.