메뉴 건너뛰기




Volumn 117, Issue 2, 1999, Pages 396-413

Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING; STRATEGIC PLANNING;

EID: 0032688613     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00279-3     Document Type: Article
Times cited : (29)

References (13)
  • 4
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • J. Du, J.Y.T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematical Operations Research 15 (1990) 483-495.
    • (1990) Mathematical Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 7
    • 0042270463 scopus 로고    scopus 로고
    • Stochastic programming approaches to stochastic scheduling
    • J.R. Birge, M.A.H. Dempster, Stochastic programming approaches to stochastic scheduling, Journal of Global Optimization 9 (1996) 417-451.
    • (1996) Journal of Global Optimization , vol.9 , pp. 417-451
    • Birge, J.R.1    Dempster, M.A.H.2
  • 12
    • 0017972181 scopus 로고
    • Dynamic programming solutions of sequencing problems with precedence constraints
    • L.E. Schrage, K.R. Baker, Dynamic programming solutions of sequencing problems with precedence constraints, Operations Research 26 (1978) 444-449.
    • (1978) Operations Research , vol.26 , pp. 444-449
    • Schrage, L.E.1    Baker, K.R.2


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