메뉴 건너뛰기
Journal of Algorithms
Volumn 57, Issue 1, 2005, Pages 49-73
Optimal non-preemptive semi-online scheduling on two related machines
Author keywords

Competitive ratio; LPT; Makespan; Scheduling; Semi online
Indexed keywords

ALGORITHMS; MACHINERY; ONLINE SYSTEMS; PROBLEM SOLVING;
EID: 24944513455     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.11.002     Document Type: Article
Times cited : (18)
References (8)
  • 1
    • 0002575388 scopus 로고
    • Bounds for list schedules on uniform processors
    • Y. Cho, and S. Sahni Bounds for list schedules on uniform processors SIAM J. Comput. 9 1 1980 91 103
    • (1980) SIAM J. Comput. , vol.9 , Issue.1 , pp. 91-103
    • Cho, Y.1    Sahni, S.2
  • 2
    • 0021522382 scopus 로고
    • Scheduling independent tasks on uniform processors
    • G. Dobson Scheduling independent tasks on uniform processors SIAM J. Comput. 13 4 1984 705 716
    • (1984) SIAM J. Comput. , vol.13 , Issue.4 , pp. 705-716
    • Dobson, G.1
  • 4
    • 0023366436 scopus 로고
    • Tighter bounds for LPT scheduling on uniform processors
    • D.K. Friesen Tighter bounds for LPT scheduling on uniform processors SIAM J. Comput. 16 3 1987 554 560
    • (1987) SIAM J. Comput. , vol.16 , Issue.3 , pp. 554-560
    • Friesen, D.K.1
  • 5
    • 0001748460 scopus 로고
    • Bounds for LPT schedules on uniform processors
    • T. Gonzalez, O.H. Ibarra, and S. Sahni Bounds for LPT schedules on uniform processors SIAM J. Comput. 6 1 1977 155 166
    • (1977) SIAM J. Comput. , vol.6 , Issue.1 , pp. 155-166
    • Gonzalez, T.1    Ibarra, O.H.2    Sahni, S.3
  • 6
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • R.L. Graham Bounds on multiprocessing timing anomalies SIAM J. Appl. Math. 17 1969 416 429
    • (1969) SIAM J. Appl. Math. , vol.17 , pp. 416-429
    • Graham, R.L.1
  • 7
    • 0030682580 scopus 로고    scopus 로고
    • A parametric worst case analysis of the LPT heuristic for two uniform machines
    • P. Mireault, J.B. Orlin, and R.V. Vohra A parametric worst case analysis of the LPT heuristic for two uniform machines Oper. Res. 45 1997 116 125
    • (1997) Oper. Res. , vol.45 , pp. 116-125
    • Mireault, P.1    Orlin, J.B.2    Vohra, R.V.3
  • 8
    • 0034504573 scopus 로고    scopus 로고
    • Semi-online scheduling with decreasing job sizes
    • S. Seiden, J. Sgall, and G.J. Woeginger Semi-online scheduling with decreasing job sizes Oper. Res. Lett. 27 5 2000 215 221
    • (2000) Oper. Res. Lett. , vol.27 , Issue.5 , pp. 215-221
    • Seiden, S.1    Sgall, J.2    Woeginger, G.J.3

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.