메뉴 건너뛰기




Volumn 30, Issue 2, 2002, Pages 100-106

Minimizing the expected number of tardy jobs when processing times are normally distributed

Author keywords

Heuristic; Single machine; Stochastic scheduling; Tardy jobs

Indexed keywords

HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES;

EID: 0036543592     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00110-4     Document Type: Article
Times cited : (27)

References (13)
  • 1
    • 0001558332 scopus 로고
    • Scheduling to minimize the number of late jobs when set-up and processing times are uncertain
    • (1973) Management Sci. , vol.19 , pp. 1283-1288
    • Balut, S.J.1
  • 10
    • 0020748381 scopus 로고
    • Stochastic scheduling with release dates and due dates
    • (1983) Oper. Res. , vol.31 , pp. 559-572
    • Pinedo, M.1


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