SCOPUS 정보 검색 플랫폼

Volumn 19, Issue 1, 1997, Pages 5-10

On the complexity of two machine job-shop scheduling with regular objective functions

Author keywords

Job shop; Polynomial algorithm

Indexed keywords

EID: 0010651843 PISSN: 01716468 EISSN: None Source Type: Journal
DOI: 10.1007/BF01539799 Document Type: Article

Times cited : (15)

References (14)

1
- 0004115996
- Prentice Hall, Englewood Cliffs
- Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows. Prentice Hall, Englewood Cliffs
- (1993) Network Flows
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

2
- 0004048738
- Springer, Berlin Heidelberg New York
- Blazewicz J, Ecker K, Schmidt G, Weglarz J (1993) Scheduling in Computer and Manufacturing Systems. Springer, Berlin Heidelberg New York
- (1993) Scheduling in Computer and Manufacturing Systems
- Blazewicz, J.¹ Ecker, K.² Schmidt, G.³ Weglarz, J.⁴

3
- 0024142036
- An efficient algorithm for the job-shop problem with two jobs
- Brucker P (1988) An efficient algorithm for the job-shop problem with two jobs. Computing 40:353-359
- (1988) Computing , vol.40 , pp. 353-359
- Brucker, P.¹

4
- 0039177811
- A polynomial algorithm for the two machine jobshop scheduling problem with a fixed number of jobs
- Brucker P (1994) A polynomial algorithm for the two machine jobshop scheduling problem with a fixed number of jobs. OR Spektrum 16:5-7
- (1994) OR Spektrum , vol.16 , pp. 5-7
- Brucker, P.¹

5
- 84891459569
- Springer, Berlin
- Brucker P (1995) Scheduling Algorithms. Springer, Berlin
- (1995) Scheduling Algorithms
- Brucker, P.¹

6
- 0038635666
- Springer, Berlin
- Domschke W, Scholl A, Vog S (1993) Produktionsplanung. Springer, Berlin
- (1993) Produktionsplanung
- Domschke, W.¹ Scholl, A.² Vog, S.³

7
- 0016952078
- The complexity of flowshop and jobshop scheduling
- Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117-129
- (1976) Math Oper Res , vol.1 , pp. 117-129
- Garey, M.R.¹ Johnson, D.S.² Sethi, R.³

8
- 0040362439
- An extension of Johnson's results onj ob lot scheduling
- Jackson JR (1956) An extension of Johnson's results onj ob lot scheduling. Naval Research Logistic Quarterly 3:201-203
- (1956) Naval Research Logistic Quarterly , vol.3 , pp. 201-203
- Jackson, J.R.¹

9
- 0029709725
- Optimal makespan schedule for three jobs on two machines
- Kravchenko SA, Sotskov YN (1996) Optimal makespan schedule for three jobs on two machines. Z Oper Res 43:233-238
- (1996) Z Oper Res , vol.43 , pp. 233-238
- Kravchenko, S.A.¹ Sotskov, Y.N.²

11
- 77951139709
- Complexity of machine scheduling problems
- Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discr Math 1:343-362
- (1977) Ann Discr Math , vol.1 , pp. 343-362
- Lenstra, J.K.¹ Rinnooy Kan, A.H.G.² Brucker, P.³

13
- 0026204971
- The complexity of shop-scheduling problems with two or three jobs
- Sotskov YN (1991) The complexity of shop-scheduling problems with two or three jobs. Eur J Oper Res 53:326-336
- (1991) Eur J Oper Res , vol.53 , pp. 326-336
- Sotskov, Y.N.¹

14
- 0010653486
- Np-hardness of shop-scheduling problems with three jobs
- Sotskov YN, Shakhlevich NV (1995) NP-hardness of shop-scheduling problems with three jobs. Discr Appl Math 59:237-266
- (1995) Discr Appl Math , vol.59 , pp. 237-266
- Sotskov, Y.N.¹ Shakhlevich, N.V.²

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