메뉴 건너뛰기




Volumn 39, Issue 12, 2012, Pages 3325-3330

The corridor allocation problem

Author keywords

Double row layout; Facility layout; Integer programming

Indexed keywords

ALLOCATION PROBLEMS; CARTESIAN COORDINATE SYSTEM; COMMUNICATION COST; DOUBLE ROW LAYOUT; FACILITY LAYOUT; HEURISTIC PROCEDURES; MIXED-INTEGER PROGRAMMING; OPTIMAL LAYOUT; PROBLEM INSTANCES;

EID: 84862985630     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.04.016     Document Type: Article
Times cited : (86)

References (15)
  • 1
    • 33646499690 scopus 로고    scopus 로고
    • On the exact solution of a facility layout problem
    • A.R.S. Amaral On the exact solution of a facility layout problem European Journal of Operational Research 173 2 2006 508 518
    • (2006) European Journal of Operational Research , vol.173 , Issue.2 , pp. 508-518
    • Amaral, A.R.S.1
  • 2
    • 61349094800 scopus 로고    scopus 로고
    • An exact approach for the one-dimensional facility layout problem
    • A.R.S. Amaral An exact approach for the one-dimensional facility layout problem Operations Research 56 2008 1026 1033
    • (2008) Operations Research , vol.56 , pp. 1026-1033
    • Amaral, A.R.S.1
  • 3
    • 56349117947 scopus 로고    scopus 로고
    • A new lower bound for the single row facility layout problem
    • A.R.S. Amaral A new lower bound for the single row facility layout problem Discrete Applied Mathematics 157 1 2009 183 190
    • (2009) Discrete Applied Mathematics , vol.157 , Issue.1 , pp. 183-190
    • Amaral, A.R.S.1
  • 6
    • 84955110931 scopus 로고    scopus 로고
    • Global approaches for facility layout and VLSI foorplanning
    • M.F. Anjos, J.B. Lasserre, Springer
    • M.F. Anjos, and F. Liers Global approaches for facility layout and VLSI foorplanning M.F. Anjos, J.B. Lasserre, Handbook on Semidefinite, Cone and Polynomial Optimization 2012 Springer 849 877
    • (2012) Handbook on Semidefinite, Cone and Polynomial Optimization , pp. 849-877
    • Anjos, M.F.1    Liers, F.2
  • 7
    • 57649191297 scopus 로고    scopus 로고
    • Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
    • M.F. Anjos, and A. Vannelli Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes INFORMS Journal on Computing 20 4 2008 611 617
    • (2008) INFORMS Journal on Computing , vol.20 , Issue.4 , pp. 611-617
    • Anjos, M.F.1    Vannelli, A.2
  • 9
    • 33644605436 scopus 로고    scopus 로고
    • Multiprocessor scheduling under precedence constraints: Polyhedral results
    • P.E. Coll, C.C. Ribeiro, and C.C. Souza Multiprocessor scheduling under precedence constraints: polyhedral results Discrete Applied Mathematics 154 2006 770 801
    • (2006) Discrete Applied Mathematics , vol.154 , pp. 770-801
    • Coll, P.E.1    Ribeiro, C.C.2    Souza, C.C.3
  • 10
    • 79955885772 scopus 로고    scopus 로고
    • Single row facility layout problem using a permutation-based genetic algorithm
    • D. Datta, A.R.S. Amaral, and J.R. Figueira Single row facility layout problem using a permutation-based genetic algorithm European Journal of Operational Research 213 2 2011 388 394
    • (2011) European Journal of Operational Research , vol.213 , Issue.2 , pp. 388-394
    • Datta, D.1    Amaral, A.R.S.2    Figueira, J.R.3
  • 13
    • 0023978605 scopus 로고
    • Machine layout problem in flexible manufacturing systems
    • S.S. Heragu, and A. Kusiak Machine layout problem in flexible manufacturing systems Operations Research. 36 2 1988 258 268 (Pubitemid 18648490)
    • (1988) Operations Research , vol.36 , Issue.2 , pp. 258-268
    • Heragu Sundereshj, S.1    Kusiak Andrew2
  • 15
    • 0012491085 scopus 로고
    • One-dimensional space allocation: An ordering algorithm
    • D.M. Simmons One-dimensional space allocation: an ordering algorithm Operations Research 17 1969 812 826
    • (1969) Operations Research , vol.17 , pp. 812-826
    • Simmons, D.M.1


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