메뉴 건너뛰기




Volumn 12, Issue 5, 1992, Pages 321-330

Efficient heuristics to minimize total flow time with release dates

(1)  Chu, Chengbin a  

a INRIA   (France)

Author keywords

heuristics; release dates; scheduling; total flow time minimization; worst case analysis

Indexed keywords


EID: 38249010591     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(92)90092-H     Document Type: Article
Times cited : (57)

References (11)
  • 4
    • 0026836953 scopus 로고
    • A branch-and-bound algorithm to minimize total flow time with unequal release dates
    • to appear
    • (1992) Naval. Res. Logist. , vol.39
    • Chu1
  • 6
    • 0020849757 scopus 로고
    • On scheduling with ready times to minimize mean flow time
    • (1983) Comput. J. , vol.26 , pp. 320-328
    • Deogun1


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