메뉴 건너뛰기




Volumn 193, Issue 2, 2009, Pages 644-645

A note on the proportionate flow shop with a bottleneck machine

Author keywords

Approximation algorithms; Flow shop sequencing; Makespan; Proportionate flow shop

Indexed keywords

HEURISTIC METHODS;

EID: 53049104711     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.01.031     Document Type: Article
Times cited : (8)

References (2)
  • 1
    • 33749558671 scopus 로고    scopus 로고
    • Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
    • Choi B.-C., Yoon S.-H., and Chung S.-J. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176 (2007) 964-974
    • (2007) European Journal of Operational Research , vol.176 , pp. 964-974
    • Choi, B.-C.1    Yoon, S.-H.2    Chung, S.-J.3
  • 2
    • 0000660478 scopus 로고
    • Flow shop sequencing with ordered processing time matrices
    • Smith M.L., Panwalkar S.S., and Dudek R.A. Flow shop sequencing with ordered processing time matrices. Management Science 21 (1975) 544-549
    • (1975) Management Science , vol.21 , pp. 544-549
    • Smith, M.L.1    Panwalkar, S.S.2    Dudek, R.A.3


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