메뉴 건너뛰기




Volumn 7, Issue 2, 2013, Pages 407-413

Optimal solutions for the double row layout problem

Author keywords

Double row layout problem; Facility layout; Integer programming; Machine layout problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; PLANT LAYOUT;

EID: 84873145939     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-011-0426-8     Document Type: Article
Times cited : (58)

References (27)
  • 1
    • 33646499690 scopus 로고    scopus 로고
    • On the exact solution of a facility layout problem
    • Amaral A. R. S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508-518 (2006).
    • (2006) Eur. J. Oper. Res. , 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
    • Amaral A. R. S.: An exact approach for the one-dimensional facility layout problem. Oper. Res. 56, 1026-1033 (2008).
    • (2008) Oper. Res. , 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
    • Amaral A. R. S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183-190 (2009).
    • (2009) Discrete Appl. Math. , vol.157 , Issue.1 , pp. 183-190
    • Amaral, A.R.S.1
  • 4
    • 68949160453 scopus 로고    scopus 로고
    • A polyhedral approach to the single-row facility layout problem
    • Department of Management Science, Lancaster University
    • Amaral, A. R. S., Letchford, A. N.: A polyhedral approach to the single-row facility layout problem, Tech. Rep., Department of Management Science, Lancaster University (2008).
    • (2008) Tech. Rep
    • Amaral, A.R.S.1    Letchford, A.N.2
  • 5
    • 22644442762 scopus 로고    scopus 로고
    • A semidefinite optimization approach for the single-row layout problem with unequal dimensions
    • Anjos M. F., Kennings A., Vannelli A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2, 113-122 (2005).
    • (2005) Discrete Optim. , vol.2 , pp. 113-122
    • Anjos, M.F.1    Kennings, A.2    Vannelli, A.3
  • 6
    • 57649191297 scopus 로고    scopus 로고
    • Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
    • Anjos M. F., Vannelli A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611-617 (2008).
    • (2008) INFORMS J. Comput. , vol.20 , Issue.4 , pp. 611-617
    • Anjos, M.F.1    Vannelli, A.2
  • 7
    • 68949107323 scopus 로고    scopus 로고
    • Provably near-optimal solutions for very large single-row facility layout problems
    • Anjos M. F., Yen G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805-817 (2009).
    • (2009) Optim. Methods Softw. , vol.24 , Issue.4 , pp. 805-817
    • Anjos, M.F.1    Yen, G.2
  • 8
    • 74549198238 scopus 로고    scopus 로고
    • The double row layout problem
    • Chung J., Tanchoco J. M. A.: The double row layout problem. Int. J. Prod. Res. 48(3), 709-727 (2010).
    • (2010) Int. J. Prod. Res. , vol.48 , Issue.3 , pp. 709-727
    • Chung, J.1    Tanchoco, J.M.A.2
  • 9
    • 33644605436 scopus 로고    scopus 로고
    • Multiprocessor scheduling under precendence constraints: polyhedral results
    • Coll P. E., Ribeiro C. C., Souza C. C.: Multiprocessor scheduling under precendence constraints: polyhedral results. Discrete Appl. Math. 154, 770-801 (2006).
    • (2006) Discrete Appl. Math. , vol.154 , pp. 770-801
    • Coll, P.E.1    Ribeiro, C.C.2    Souza, C.C.3
  • 11
    • 0021521702 scopus 로고
    • A cutting plane algorithm for the linear ordering problem
    • Grötschel M., Jünger M., Reinelt G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32, 1195-1220 (1984).
    • (1984) Oper. Res. , vol.32 , pp. 1195-1220
    • Grötschel, M.1    Jünger, M.2    Reinelt, G.3
  • 13
    • 0024717601 scopus 로고
    • A cutting plane algorithm for a clustering problem
    • Grötschel M., Wakabayashi Y.: A cutting plane algorithm for a clustering problem. Math. Progr. Ser. B 45, 59-96 (1989).
    • (1989) Math. Progr. Ser. B , vol.45 , pp. 59-96
    • Grötschel, M.1    Wakabayashi, Y.2
  • 14
    • 34249961456 scopus 로고
    • Facets of the clique partitioning polytope
    • Grötschel M., Wakabayashi Y.: Facets of the clique partitioning polytope. Math. Progr. 47, 367-387 (1990).
    • (1990) Math. Progr. , vol.47 , pp. 367-387
    • Grötschel, M.1    Wakabayashi, Y.2
  • 15
    • 72049129201 scopus 로고    scopus 로고
    • 2nd edn., Bloomington: iUniverse
    • Heragu S. S.: Facilities Design, 2nd edn. iUniverse, Bloomington (2006).
    • (2006) Facilities Design
    • Heragu, S.S.1
  • 16
    • 0026826080 scopus 로고
    • Experiment analysis of simulated annealing based algorithms for the layout problem
    • Heragu S. S., Alfa A. S.: Experiment analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57(2), 190-202 (1992).
    • (1992) Eur. J. Oper. Res. , vol.57 , Issue.2 , pp. 190-202
    • Heragu, S.S.1    Alfa, A.S.2
  • 17
    • 0023978605 scopus 로고
    • Machine layout problem in flexible manufacturing systems
    • Heragu S. S., Kusiak A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258-268 (1988).
    • (1988) Oper. Res. , vol.36 , Issue.2 , pp. 258-268
    • Heragu, S.S.1    Kusiak, A.2
  • 18
    • 0026416906 scopus 로고
    • Efficient models for the facility layout problem
    • Heragu S. S., Kusiak A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53, 1-13 (1991).
    • (1991) Eur. J. Oper. Res. , vol.53 , pp. 1-13
    • Heragu, S.S.1    Kusiak, A.2
  • 19
    • 70449404804 scopus 로고    scopus 로고
    • Scatter search algorithm for single row layout problem in FMS
    • Kumar S., Asokan P., Kumanan S., Varma B.: Scatter search algorithm for single row layout problem in FMS. Adv. Prod. Eng. Manag. 3, 193-204 (2008).
    • (2008) Adv. Prod. Eng. Manag. , vol.3 , pp. 193-204
    • Kumar, S.1    Asokan, P.2    Kumanan, S.3    Varma, B.4
  • 20
    • 0016969488 scopus 로고
    • On solving a one-dimensional space allocation problem with integer programming
    • Love R. F., Wong J. Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139-143 (1976).
    • (1976) Infor , vol.14 , Issue.2 , pp. 139-143
    • Love, R.F.1    Wong, J.Y.2
  • 21
    • 0012543530 scopus 로고
    • On the one-dimensional space allocation problem
    • Picard J.-C., Queyranne M.: On the one-dimensional space allocation problem. Oper. Res. 29(2), 371-391 (1981).
    • (1981) Oper. Res. , vol.29 , Issue.2 , pp. 371-391
    • Picard, J.-C.1    Queyranne, M.2
  • 22
    • 75849148444 scopus 로고    scopus 로고
    • An efficient tabu algorithm for the single row facility layout problem
    • Samarghandi H., Eshghi K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205, 98-105 (2010).
    • (2010) Eur. J. Oper. Res. , vol.205 , pp. 98-105
    • Samarghandi, H.1    Eshghi, K.2
  • 23
    • 77950595893 scopus 로고    scopus 로고
    • A particle swarm optimization for the single row facility layout problem
    • Samarghandi H., Taabayan P., Jahantigh F. F.: A particle swarm optimization for the single row facility layout problem. Comput. Ind. Eng. 58, 529-534 (2010).
    • (2010) Comput. Ind. Eng. , vol.58 , pp. 529-534
    • Samarghandi, H.1    Taabayan, P.2    Jahantigh, F.F.3
  • 24
    • 4344658587 scopus 로고    scopus 로고
    • Enhanced model formulations for optimal facility layout
    • Sherali H. D., Fraticelli B. M. P., Meller R. D.: Enhanced model formulations for optimal facility layout. Oper. Res. 51, 629-644 (2003).
    • (2003) Oper. Res. , vol.51 , pp. 629-644
    • Sherali, H.D.1    Fraticelli, B.M.P.2    Meller, R.D.3
  • 25
    • 0012491085 scopus 로고
    • One-dimensional space allocation: an ordering algorithm
    • Simmons D. M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17, 812-826 (1969).
    • (1969) Oper. Res. , vol.17 , pp. 812-826
    • Simmons, D.M.1
  • 26
    • 56349106257 scopus 로고
    • A further note on one-dimensional space allocation
    • Simmons D. M.: A further note on one-dimensional space allocation. Oper. Res. 19, 249 (1971).
    • (1971) Oper. Res. , vol.19 , pp. 249
    • Simmons, D.M.1
  • 27
    • 4744374111 scopus 로고    scopus 로고
    • An ant algorithm for the single row layout problem in flexible manufacturing systems
    • Solimanpur M., Vrat P., Shankar R.: An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res. 32(3), 583-598 (2005).
    • (2005) Comput. Oper. Res. , vol.32 , Issue.3 , pp. 583-598
    • Solimanpur, M.1    Vrat, P.2    Shankar, R.3


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