메뉴 건너뛰기




Volumn 39, Issue 4, 1988, Pages 359-3641

Two-stage, hybrid flowshop scheduling problem

Author keywords

Heuristics; Production scheduling; Sequencing

Indexed keywords

JOB ANALYSIS; MATHEMATICAL TECHNIQUES - HEURISTIC; PRODUCTION CONTROL; SYSTEMS SCIENCE AND CYBERNETICS - HEURISTIC PROGRAMMING;

EID: 0023995996     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1988.63     Document Type: Article
Times cited : (565)

References (8)
  • 1
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S. M. Johnson (1954) Optimal two- and three-stage production schedules with setup times included. Nav. Res. Log. Q. 1, 61-68.
    • (1954) Nav. Res. Log. Q , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 2
    • 0006859287 scopus 로고
    • An extension of two machine sequencing problem
    • T. S. Arthanary and K. G. Ramaswamy (1971) An extension of two machine sequencing problem. Opsearch 8, 10-22.
    • (1971) Opsearch , vol.8 , pp. 10-22
    • Arthanary, T.S.1    Ramaswamy, K.G.2
  • 3
    • 0344353377 scopus 로고
    • Two machine sequencing problem with parallel machines
    • B. S. Mittal and P. C. Bagga (1973) Two machine sequencing problem with parallel machines. Opsearch 10, 50-61.
    • (1973) Opsearch , vol.10 , pp. 50-61
    • Mittal, B.S.1    Bagga, P.C.2
  • 4
    • 11644307569 scopus 로고
    • On two machine sequencing problems with parallel machines
    • R. N. Murty (1974) On two machine sequencing problems with parallel machines. Opsearch 11, 42-44.
    • (1974) Opsearch , vol.11 , pp. 42-44
    • Murty, R.N.1
  • 5
    • 2542462204 scopus 로고
    • Sequencing in the order A, B with multiplicity of machines for a single operation
    • T. B. K. Rao (1970) Sequencing in the order A, B with multiplicity of machines for a single operation. Opsearch 7, 135-144.
    • (1970) Opsearch , vol.7 , pp. 135-144
    • Rao, T.B.K.1
  • 6
    • 0003200192 scopus 로고
    • Computers and Intractability: A Guide to the Theory of NP-Completeness
    • San Francisco, Calif
    • M. R. Garey and D. S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif.
    • (1979) Freeman
    • Garey, M.R.1    Johnson, D.S.2
  • 8
    • 0016521292 scopus 로고
    • Optimal schedules for special structure flowshops
    • J. N. D. Gupta (1975) Optimal schedules for special structure flowshops. Nav. Res. Log. Q. 26, 255-269.
    • (1975) Nav. Res. Log. Q , vol.26 , pp. 255-269
    • Gupta, J.N.D.1


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