메뉴 건너뛰기
Journal of Computer and System Sciences
Volumn 67, Issue 1, 2003, Pages 198-208
Scheduling loosely connected task graphs
Author keywords

Approximation algorithm; Precedence constrained scheduling
Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; POLYNOMIALS; SCHEDULING;
EID: 0041519054     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00071-0     Document Type: Article
Times cited : (2)
References (7)
  • 1
    • 0028454912 scopus 로고
    • A new insight into the Coffman-Graham algorithm
    • B. Braschi, D. Trystram, A new insight into the Coffman-Graham algorithm, SIAM J. Comput. 23 (3) (1994) 662-669.
    • (1994) SIAM J. Comput. , vol.23 , Issue.3 , pp. 662-669
    • Braschi, B.1    Trystram, D.2
  • 2
    • 84979252553 scopus 로고
    • Approximation algorithms for problems in combinatorial optimization
    • Department of Computer Science and Engineering, Indian Institute of Technology, Bombay
    • M. Charikar. Approximation algorithms for problems in combinatorial optimization, B. Tech. Project Report, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, 1995.
    • (1995) B. Tech. Project Report
    • Charikar, M.1
  • 3
    • 0015482117 scopus 로고
    • Optimal scheduling for two-processor systems
    • E. Coffman, R. Graham, Optimal scheduling for two-processor systems, Acta Inform. 1 (1972) 200-213.
    • (1972) Acta Inform. , vol.1 , pp. 200-213
    • Coffman, E.1    Graham, R.2
  • 4
    • 0014534836 scopus 로고
    • Optimal sequence of two equivalent processors
    • M. Fujii, T. Kasami, K. Ninomiya, Optimal sequence of two equivalent processors, SIAM J. Appl. Math. 17 (3) (1969) 784-789.
    • (1969) SIAM J. Appl. Math. , vol.17 , Issue.3 , pp. 784-789
    • Fujii, M.1    Kasami, T.2    Ninomiya, K.3
  • 5
    • 0001430010 scopus 로고
    • Parallel sequencing and assembly line problems
    • T. Hu, Parallel sequencing and assembly line problems, Oper. Res. 9 (6) (1961) 61-68.
    • (1961) Oper. Res. , vol.9 , Issue.6 , pp. 61-68
    • Hu, T.1
  • 6
    • 0038527446 scopus 로고
    • Worst-case analysis of two scheduling algorithms
    • S. Lam, R. Sethi, Worst-case analysis of two scheduling algorithms, SIAM J. Comput. 6 (1977) 518-536.
    • (1977) SIAM J. Comput. , vol.6 , pp. 518-536
    • Lam, S.1    Sethi, R.2
  • 7
    • 0017924416 scopus 로고
    • Complexity of scheduling under precedence constraints
    • J. Lenstra, A. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res. 26 (1978) 22-35.
    • (1978) Oper. Res. , vol.26 , pp. 22-35
    • Lenstra, J.1    Rinnooy Kan, A.2

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