메뉴 건너뛰기
Computing (Vienna/New York)
Volumn 69, Issue 1, 2002, Pages 37-49
On the complexity of non-preemptive shop scheduling with two jobs
Author keywords

Computational complexity; Mixed shop scheduling; Pseudo polynomial time algorithm
Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;
EID: 0036392349     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-002-1455-z     Document Type: Article
Times cited : (5)
References (11)
  • 2
    • 0024142036 scopus 로고
    • An efficient algorithm for the job-shop problem with two jobs
    • Brucker, P.: An efficient algorithm for the job-shop problem with two jobs. Comp. 40, 353-359 (1988).
    • (1988) Comp. , vol.40 , pp. 353-359
    • Brucker, P.1
  • 3
    • 0010651843 scopus 로고    scopus 로고
    • On the complexity of two machine job-shop scheduling with regular objective functions
    • Brucker, P., Kravchenko, S.A., Sotskov, Yu.N.: On the complexity of two machine job-shop scheduling with regular objective functions. OR Spektrum 19, 5-10 (1997).
    • (1997) OR Spektrum , vol.19 , pp. 5-10
    • Brucker, P.1    Kravchenko, S.A.2    Sotskov, Yu.N.3
  • 4
    • 0003603813 scopus 로고
    • Computers and intractability: A guide to the theory of NP-completeness
    • San Francisco: WH Freeman
    • Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. (Series of Books in the Mathematical Sciences). San Francisco: WH Freeman 1979.
    • (1979) Series of Books in the Mathematical Sciences
    • Garey, M.R.1    Johnson, D.S.2
  • 5
    • 0017012325 scopus 로고
    • Open shop scheduling to minimize finish time
    • Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665-679 (1976).
    • (1976) J. ACM , vol.23 , Issue.4 , pp. 665-679
    • Gonzalez, T.1    Sahni, S.2
  • 6
    • 0010737739 scopus 로고    scopus 로고
    • Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
    • Middendorf, M., Timkovsky, V.G.: Transversal graphs for partially ordered sets: sequencing, merging and scheduling problems. J. Comb. Optim. 3, 417-435 (1999).
    • (1999) J. Comb. Optim. , vol.3 , pp. 417-435
    • Middendorf, M.1    Timkovsky, V.G.2
  • 7
    • 0028739190 scopus 로고
    • Scheduling two jobs with fixed and nonfixed routines
    • Shakhlevich, N.V., Sotskov, Yu.N.: Scheduling two jobs with fixed and nonfixed routines. Comp. 52, 17-30 (1994).
    • (1994) Comp. , vol.52 , pp. 17-30
    • Shakhlevich, N.V.1    Sotskov, Yu.N.2
  • 8
    • 0033483715 scopus 로고    scopus 로고
    • Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
    • Shakhlevich, N.V., Sotskov, Yu.N., Werner, F.: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs. Ann. Oper. Res. 92, 281-304 (1999).
    • (1999) Ann. Oper. Res. , vol.92 , pp. 281-304
    • Shakhlevich, N.V.1    Sotskov, Yu.N.2    Werner, F.3
  • 10
    • 0026204971 scopus 로고
    • The complexity of shop-scheduling problems with two or three jobs
    • Sotskov, Yu.N.: The complexity of shop-scheduling problems with two or three jobs. Eur. Jour. Oper. Res. 53, 326-336 (1991).
    • (1991) Eur. Jour. Oper. Res. , vol.53 , pp. 326-336
    • Sotskov, Yu.N.1
  • 11
    • 0010653486 scopus 로고
    • NP-hardness of shop-scheduling problems with three jobs
    • Sotskov, Yu.N., Shakhlevich, N.V.: NP-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59, 237-266 (1995).
    • (1995) Discrete Appl. Math. , vol.59 , pp. 237-266
    • Sotskov, Yu.N.1    Shakhlevich, N.V.2

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