메뉴 건너뛰기
OR Spektrum
Volumn 21, Issue 4, 1999, Pages 477-492
A 2-machine sequencing problem with machine repetition and overlapping processing times
Author keywords

Flow shop scheduling; Machine repetition; Overlapping processing times
Indexed keywords

EID: 0442296309     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002910050099     Document Type: Article
Times cited : (1)
References (8)
  • 1
    • 0020205376 scopus 로고
    • Complexity and solutions of some three-stage flow shop scheduling problems
    • Achugbue JO, Chin FY (1982) Complexity and solutions of some three-stage flow shop scheduling problems. Math Oper Res 7: 532-544
    • (1982) Math Oper Res , vol.7 , pp. 532-544
    • Achugbue, J.O.1    Chin, F.Y.2
  • 2
    • 0039177811 scopus 로고
    • A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
    • Brucker P (1994) A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs. OR Spektrum 16: 5-7
    • (1994) OR Spektrum , vol.16 , pp. 5-7
    • Brucker, P.1
  • 3
    • 0010651843 scopus 로고    scopus 로고
    • On the complexity of two machine job-shop scheduling with regular objective functions
    • Brucker P, Kravchenko SA, Sotskov YN (1997) On the complexity of two machine job-shop scheduling with regular objective functions. OR Spektrum 19: 5-10
    • (1997) OR Spektrum , vol.19 , pp. 5-10
    • Brucker, P.1    Kravchenko, S.A.2    Sotskov, Y.N.3
  • 5
    • 0016952078 scopus 로고
    • 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.1    Johnson, D.S.2    Sethi, R.3
  • 6
    • 0003075019 scopus 로고
    • Optimal two-and three-stage production schedules with set-up times included
    • Johnson SM (1954) Optimal two-and three-stage production schedules with set-up times included. Nav Res Log Quart 1: 61-68
    • (1954) Nav Res Log Quart , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 7
    • 0017924416 scopus 로고
    • Complexity of scheduling under precedence constraints
    • Lenstra JK, Rinnooy Kan AHG (1978) Complexity of scheduling under precedence constraints. Opns Res 26: 22-35
    • (1978) Opns Res , vol.26 , pp. 22-35
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 8
    • 0001551888 scopus 로고
    • Sequencing jobs on two machines with arbitrary time lags
    • Mitten LG (1959) Sequencing jobs on two machines with arbitrary time lags. Management Sci 5: 293-298
    • (1959) Management Sci , vol.5 , pp. 293-298
    • Mitten, L.G.1

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