메뉴 건너뛰기




Volumn 1809, Issue , 2000, Pages 213-225

Greedy algorithms for the multi-capacitated metric scheduling problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SCHEDULING;

EID: 84943272233     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_17     Document Type: Conference Paper
Times cited : (2)

References (11)
  • 9
    • 0030125477 scopus 로고    scopus 로고
    • A computational study of constraint sa-tisfaction for multiple capacitated job shop scheduling
    • W.P.M.Nuijten and E.H.L.Aarts.A Computational Study of Constraint Sa-tisfaction for Multiple Capacitated Job Shop Scheduling.European Journal of Operational Research, 90(2):269-284, 1996.
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 269-284
    • Nuijten, W.P.M.1    Aarts, E.H.L.2


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