메뉴 건너뛰기




Volumn 48, Issue 6, 1993, Pages 315-320

Complexity of scheduling tasks with time-dependent execution times

Author keywords

Algorithms; Deadline; Feasible schedule; Nonpreemptive schedule; NP complete; Polynomial time algorithm; Release time; Single processor

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MILITARY APPLICATIONS; POLYNOMIALS; TIME VARYING NETWORKS;

EID: 0027885153     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(93)90175-9     Document Type: Article
Times cited : (92)

References (7)
  • 1
    • 84914976322 scopus 로고    scopus 로고
    • J. Berger, Private communication.


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