메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 54, Issue 11, 2003, Pages 1222-1224
Due-date assignment with asymmetric earliness-tardiness cost
Author keywords

Due date assignment; Parallel machines; Scheduling; Single machine
Indexed keywords

COSTS; HEURISTIC METHODS; LINEAR PROGRAMMING; POLYNOMIALS; SCHEDULING;
EID: 0242662775     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601624     Document Type: Article
Times cited : (7)
References (3)
  • 1
    • 0028377693 scopus 로고
    • The parallel machine min-max weighted absolute lateness scheduling problem
    • Li C-L and Cheng TCE (1994). The parallel machine min-max weighted absolute lateness scheduling problem. Naval Res Logist 41: 33-46.
    • (1994) Naval Res Logist , vol.41 , pp. 33-46
    • Li, C.-L.1    Cheng, T.C.E.2
  • 2
    • 0037118177 scopus 로고    scopus 로고
    • A survey of the state-of-the-art of common due date assignment and scheduling research
    • Gordon V, Proth J-M and Chu C (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139: 1-25.
    • (2002) Eur J Oper Res , vol.139 , pp. 1-25
    • Gordon, V.1    Proth, J.-M.2    Chu, C.3
  • 3
    • 0021372387 scopus 로고
    • Linear time algorithms for two- and three-variable linear programs
    • Dyer ME (1984). Linear time algorithms for two- and three-variable linear programs. SIAM J Comput 13: 31-45.
    • (1984) SIAM J Comput , vol.13 , pp. 31-45
    • Dyer, M.E.1

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