A lower bound for scheduling of unit jobs with immediate decision on parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5426 LNCS, Issue , 2009, Pages 43-52

  Ebenlendr, Tomáš ^a   Sgall, Jiří ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY; SCHEDULING; SCHEDULING ALGORITHMS;

IDENTICAL MACHINES; LOWER BOUNDS; ON-LINE ALGORITHMS; PARALLEL MACHINES; RELEASE TIME;

APPROXIMATION ALGORITHMS;

EID: 60349099871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-93980-1_4     Document Type: Conference Paper

References (9)

1. Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. J. Comb. Math. Comb. Comput. 39, 65-78 (2001);
2. a preliminary version appeared in: Proc. 15th Real-Time Systems Symp., pp. 228-236. IEEE, Los Alamitos (1994)
3. Birnbaum, B.E., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39, 80-87 (2008)
4. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36, 1709-1728 (2007);
5. a preliminary version appeared in: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 358-370. Springer, Heidelberg (2004)
6. Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online scheduling of equal-length jobs on parallel machines. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 427-438. Springer, Heidelberg (2007)
7. Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 32-42. Springer, Heidelberg (2006)
8. Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. J. Algorithms 34, 370-389 (2000)
9. Goldwasser, M.H., Pedigo, M.: Online, non-preemptive scheduling of equal-length jobs on two identical machines. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 113-123. Springer, Heidelberg (2006); to appear in ACM Transactions on Algorithms