메뉴 건너뛰기




Volumn 74, Issue 2, 1997, Pages 197-201

On complexity of minimizing weighted number of late jobs in unit time open shops

Author keywords

Open shop; script N sign hard problem; Unit processing times

Indexed keywords


EID: 0038527476     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)81448-5     Document Type: Article
Times cited : (3)

References (6)
  • 1
    • 0037513529 scopus 로고
    • Open shop problems with unit time operations
    • P. Brucker, B. Jurisch and M. Jurisch, Open shop problems with unit time operations, Z. Open Res. 37 (1993) 59-73.
    • (1993) Z. Open Res. , vol.37 , pp. 59-73
    • Brucker, P.1    Jurisch, B.2    Jurisch, M.3
  • 2
    • 38248999492 scopus 로고
    • Scheduling unit time open shops to minimize the weighted number of late jobs
    • P. Brucker, B. Jurisch, T. Tautenhahn and F. Werner, Scheduling unit time open shops to minimize the weighted number of late jobs, Oper. Res. Lett. 14 (1993) 245-250.
    • (1993) Oper. Res. Lett. , vol.14 , pp. 245-250
    • Brucker, P.1    Jurisch, B.2    Tautenhahn, T.3    Werner, F.4
  • 3
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • R.E. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kann, 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
  • 4
    • 0037851110 scopus 로고
    • A note on the complexity of open-shop scheduling problems
    • W. Kubiak, C. Sriskandarajah and K. Zaras, A note on the complexity of open-shop scheduling problems, INFOR 29 (1991) 284-294.
    • (1991) INFOR , vol.29 , pp. 284-294
    • Kubiak, W.1    Sriskandarajah, C.2    Zaras, K.3
  • 5
    • 0024038037 scopus 로고
    • Scheduling open shops with unit execution times to minimize functions of due dates
    • C.Y. Liu and R.L. Bulfin, Scheduling open shops with unit execution times to minimize functions of due dates, Oper. Res. 36 (1985) 553-559.
    • (1985) Oper. Res. , vol.36 , pp. 553-559
    • Liu, C.Y.1    Bulfin, R.L.2


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