메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 100, Issue 1-2, 2000, Pages 127-132
On the complexity of minimizing the number of late jobs in unit time open shop
Author keywords

Open shop; Unary NP hard
Indexed keywords

EID: 0038527464     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00202-4     Document Type: Article
Times cited : (20)
References (4)
  • 1
    • 0037513529 scopus 로고
    • Open shop problems with unit time operations
    • Brucker P., Jurisch B., Jurisch M. Open shop problems with unit time operations. Z. Oper. Res. 37:1993;59-73.
    • (1993) Z. Oper. Res. , vol.37 , pp. 59-73
    • Brucker, P.1    Jurisch, B.2    Jurisch, M.3
  • 2
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Graham R.E., Lawler E.L., Lenstra J.K., Rinnooy Kann A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5:1979;287-326.
    • (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.E.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kann, A.H.G.4
  • 3
    • 0038527476 scopus 로고    scopus 로고
    • On complexity of minimizing weighted number of late jobs in unit time open shops
    • Gladky A.A. On complexity of minimizing weighted number of late jobs in unit time open shops. Discrete Appl. Math. 74:1997;197-201.
    • (1997) Discrete Appl. Math. , vol.74 , pp. 197-201
    • Gladky, A.A.1
  • 4
    • 0010916439 scopus 로고
    • Recent results in the theory of machine scheduling
    • in: A.Bachem et al. (Eds.), Springer, Berlin
    • E.L. Lawler, Recent results in the theory of machine scheduling in: A.Bachem et al. (Eds.), Mathematical Programming: the State of the Art, Springer, Berlin, 1982, pp. 202-234.
    • (1982) Mathematical Programming: The State of the Art , pp. 202-234
    • Lawler, E.L.1

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