메뉴 건너뛰기





Volumn , Issue , 1997, Pages 581-590

Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ESTIMATION; LINEAR PROGRAMMING; PROBLEM SOLVING; QUEUEING THEORY; SCHEDULING;

EID: 0030785234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (36)

References (14)
  • Reference 정보가 존재하지 않습니다.

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