메뉴 건너뛰기




Volumn 106, Issue 1, 1998, Pages 101-107

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

Author keywords

Job shop; No wait in process; Optimal mean flow time schedule; Polynomial algorithm; Unit processing time

Indexed keywords


EID: 0037851100     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00102-1     Document Type: Article
Times cited : (10)

References (11)
  • 2
    • 0016080006 scopus 로고
    • Scheduling independent tasks to reduce mean finishing time
    • J. Bruno, E.G. Coffman, Jr., R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM 17 (1974) 382-387.
    • (1974) Communications of the ACM , vol.17 , pp. 382-387
    • Bruno, J.1    Coffman E.G., Jr.2    Sethi, R.3
  • 4
    • 0001068310 scopus 로고
    • Sequencing a one state-variable machine: A solvable case of the traveling salesman problem
    • P.C. Gilmore, R.E. Gomory, Sequencing a one state-variable machine: a solvable case of the traveling salesman problem, Operations Research 12 (1964) 655-679.
    • (1964) Operations Research , vol.12 , pp. 655-679
    • Gilmore, P.C.1    Gomory, R.E.2
  • 6
    • 0001115685 scopus 로고
    • No-wait shop scheduling: Computational complexity and approximate algorithms
    • S.K. Goyal, C. Sriskandarajah, No-wait shop scheduling: computational complexity and approximate algorithms, Opsearch 25 (1988) 220-244.
    • (1988) Opsearch , vol.25 , pp. 220-244
    • Goyal, S.K.1    Sriskandarajah, C.2
  • 7
    • 0030134958 scopus 로고    scopus 로고
    • A survey of machine scheduling problems with blocking and no-wait in process
    • N.G. Hall, C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research 44 (1996) 510-525.
    • (1996) Operations Research , vol.44 , pp. 510-525
    • Hall, N.G.1    Sriskandarajah, C.2
  • 8
    • 0024916622 scopus 로고
    • A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
    • W. Kubiak, A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem, European Journal of Operational Research 43 (1989) 267-270.
    • (1989) European Journal of Operational Research , vol.43 , pp. 267-270
    • Kubiak, W.1
  • 9
    • 0008646721 scopus 로고
    • Some new results in no-wait flowshop scheduling
    • H. Röck, Some new results in no-wait flowshop scheduling, Zeitschrift für Operations Research 28 (1984) 1-16.
    • (1984) Zeitschrift für Operations Research , vol.28 , pp. 1-16
    • Röck, H.1


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