메뉴 건너뛰기




Volumn 63, Issue 1, 2006, Pages 63-75

Scheduling chains with identical jobs and constant delays on a single machine

Author keywords

Complexity results; Delays; Scheduling; Time lags

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

EID: 32044466907     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1016/j.jmwh.2005.08.017     Document Type: Article
Times cited : (9)

References (4)
  • 1
    • 0037513525 scopus 로고    scopus 로고
    • Complexity results for single-machine problems with positive finish-start time-lags
    • Brucker P, Knust S (1999) Complexity results for single-machine problems with positive finish-start time-lags. Computing 63:299-316
    • (1999) Computing , vol.63 , pp. 299-316
    • Brucker, P.1    Knust, S.2
  • 2
    • 21244487153 scopus 로고    scopus 로고
    • Scheduling chains on a single machine with non-negative time-lags
    • Munier A, Sourd F (2003) Scheduling chains on a single machine with non-negative time-lags. Math Meth Oper Res 57:111-123
    • (2003) Math Meth Oper Res , vol.57 , pp. 111-123
    • Munier, A.1    Sourd, F.2
  • 3
    • 0013363622 scopus 로고
    • One-machine generalized precedence constrained scheduling problems
    • Wikum ED, Llewellyn DC, Nemhauser GL (1994) One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87-99
    • (1994) Oper Res Lett , vol.16 , pp. 87-99
    • Wikum, E.D.1    Llewellyn, D.C.2    Nemhauser, G.L.3


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