메뉴 건너뛰기




Volumn 197, Issue 3, 2009, Pages 1119-1132

Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads

Author keywords

Combinatorial optimization; Facilities planning and design; Integer programming; Production

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONTROL THEORY; DESIGN; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING;

EID: 62149119493     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.03.028     Document Type: Article
Times cited : (42)

References (25)
  • 2
    • 0034294050 scopus 로고    scopus 로고
    • Heuristic methods for cost oriented assembly line balancing: A survey
    • Amen M. Heuristic methods for cost oriented assembly line balancing: A survey. International Journal of Production Economics 68 (2002) 1-14
    • (2002) International Journal of Production Economics , vol.68 , pp. 1-14
    • Amen, M.1
  • 3
    • 0035852818 scopus 로고    scopus 로고
    • Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time
    • Amen M. Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time. International Journal of Production Economics 69 (2001) 255-264
    • (2001) International Journal of Production Economics , vol.69 , pp. 255-264
    • Amen, M.1
  • 4
    • 0022768294 scopus 로고
    • A survey of exact algorithms for the simple assembly line balancing problem
    • Baybars I. A survey of exact algorithms for the simple assembly line balancing problem. Management Science 32 (1986) 909-932
    • (1986) Management Science , vol.32 , pp. 909-932
    • Baybars, I.1
  • 6
    • 0037230929 scopus 로고    scopus 로고
    • A weighted approach for assembly line design with station paralleling and equipment selection
    • Bukchin J., and Rubinovitz J. A weighted approach for assembly line design with station paralleling and equipment selection. IIE Transactions 35 (2002) 73-85
    • (2002) IIE Transactions , vol.35 , pp. 73-85
    • Bukchin, J.1    Rubinovitz, J.2
  • 7
    • 0033750053 scopus 로고    scopus 로고
    • Design of flexible assembly line to minimize equipment cost
    • Bukchin J., and Tzur M. Design of flexible assembly line to minimize equipment cost. IIE Transactions 32 (2000) 585-598
    • (2000) IIE Transactions , vol.32 , pp. 585-598
    • Bukchin, J.1    Tzur, M.2
  • 12
    • 33746402024 scopus 로고    scopus 로고
    • MIP approach to balancing transfer lines with blocks of parallel operations
    • Dolgui A., Finel B., Guschinsky N., Levin G., and Vernadat F. MIP approach to balancing transfer lines with blocks of parallel operations. IIE Transactions 38 (2006) 869-882
    • (2006) IIE Transactions , vol.38 , pp. 869-882
    • Dolgui, A.1    Finel, B.2    Guschinsky, N.3    Levin, G.4    Vernadat, F.5
  • 14
    • 0024641634 scopus 로고
    • A comprehensive literature review and analysis of the design, balancing and scheduling of assembly line systems
    • Ghosh S., and Gagnon R.J. A comprehensive literature review and analysis of the design, balancing and scheduling of assembly line systems. International Journal of Production Research 27 (1989) 637-670
    • (1989) International Journal of Production Research , vol.27 , pp. 637-670
    • Ghosh, S.1    Gagnon, R.J.2
  • 18
    • 0015093943 scopus 로고
    • Optimal networks partitioning
    • Jensen P.A. Optimal networks partitioning. Operations Research 19 (1971) 916-924
    • (1971) Operations Research , vol.19 , pp. 916-924
    • Jensen, P.A.1
  • 19
    • 0001619835 scopus 로고
    • The set partition problem: Set covering with equality constraints
    • Garfinkel R.S., and Nemhauser G.L. The set partition problem: Set covering with equality constraints. Operations Research 17 (1969) 848-856
    • (1969) Operations Research , vol.17 , pp. 848-856
    • Garfinkel, R.S.1    Nemhauser, G.L.2
  • 20
    • 0004644916 scopus 로고
    • Improved combinatorial programming algorithms for a class of all-zero-one integer programming problem
    • Pierce J.F., and Lasky J.S. Improved combinatorial programming algorithms for a class of all-zero-one integer programming problem. Management Science 19 (1973) 528-536
    • (1973) Management Science , vol.19 , pp. 528-536
    • Pierce, J.F.1    Lasky, J.S.2
  • 23
    • 0032117097 scopus 로고    scopus 로고
    • A survey of the assembly line balancing procedures
    • Erel E., and Sarin S.C. A survey of the assembly line balancing procedures. Production Planning and Control 9 5 (1998) 414-434
    • (1998) Production Planning and Control , vol.9 , Issue.5 , pp. 414-434
    • Erel, E.1    Sarin, S.C.2
  • 25
    • 0020116655 scopus 로고
    • Assembly line balancing as generalized bin packing
    • Wee T.S., and Magazine M.J. Assembly line balancing as generalized bin packing. Operations Research Letters 1/2 (1982) 56-58
    • (1982) Operations Research Letters , vol.1-2 , pp. 56-58
    • Wee, T.S.1    Magazine, M.J.2


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