메뉴 건너뛰기




Volumn 84, Issue 1-3, 1998, Pages 253-257

Uniform machine scheduling of unit-time jobs subject to resource constraints

Author keywords

Computational complexity; Machine scheduling; Resource constrained scheduling

Indexed keywords


EID: 0005889248     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00138-8     Document Type: Article
Times cited : (14)

References (5)
  • 1
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints: Classification and complexity
    • J. Blazewicz, J.K. Lenstra, A.H.G. Rinnooy Kan Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5 (1983) 11-24.
    • (1983) Discrete Appl. Math. , vol.5 , pp. 11-24
    • Blazewicz, J.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 3
    • 0000135213 scopus 로고
    • Algorithms for two bottleneck optimization problems
    • M. Gabow, R.E. Tarjan Algorithms for two bottleneck optimization problems J. Algorithms 9 (1988) 411-417.
    • (1988) J. Algorithms , vol.9 , pp. 411-417
    • Gabow, M.1    Tarjan, R.E.2


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