Online time constrained scheduling with penalties

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Thibault, Nicolas ^a   Laforest, Christian ^a  

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

Author keywords

Competitive ratio; Keywords; Online scheduling; Penalties; Weight maximization

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; SCHEDULING;

COMPETITIVE RATIO; KEYWORDS; MULTIPLE MACHINE; ON-LINE ALGORITHMS; ONLINE SCHEDULING; ONLINE TIME; PENALTIES; SCHEDULING JOBS;

SCHEDULING ALGORITHMS;

EID: 70450058736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5160994     Document Type: Conference Paper

References (17)

1. R. Adler and Y. Azar. Beating the logarithmic lower bound: Randomized preemptive disjoint paths and call control algorithms. J. 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, pages 312 - 323. Springer, LNCS 3648, 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, pages 308- 317. Springer, LNCS 3595, 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 J. Comput., 31:331-352, 2001.
6. A. Borodin and R. El-Yaniv. 0. Cambridge University press, 1998.
7. U. Faigle and W. Nawijn. Note on scheduling intervals online. Discrete Applied Mathematics, 58(58):13-17, 1994.
8. S. Fung. Lower bounds on online deadline scheduling with preemption penalties. Information Processing Letters, (Available online 31 May 2008), 2008.
9. J. Garay, I. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. J. of Algorithms, 23(1):180-194, 1997.
10. 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.
11. S. Goldman, J. Parwatikar, and S. Suri. On-line scheduling with hard deadlines. In WADS: 5th Workshop on Algorithms and Data Structures, pages 258-271, 1997.
12. M. Goldwasser. Patience is a virtue: the effect of slackon competitiveness for admission control. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 396- 405, 1999.
13. R. Lipton and A. Tomkins. Online interval scheduling. In 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1806-1828, 1994.
14. J. Naor, A. Rosen, and G. Scalosub. Online time-constrained scheduling in linear networks. In Proceedings of INFOCOM, volume 2, pages 855-865, 2005.
15. N. Thibault and C. Laforest. On-line time-constrained scheduling problem for the size on k machines. In I-SPAN, pages 20 - 24, 2005.
16. G. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130(130):5- 16, 1994.
17. F. Zheng, Y. Xu, and E. Zhang. On-line production order scheduling with preemption penalties. Journal of Combinatorial Optimization, 13(2):189-204, 2007.