Optimal solutions for the double row layout problem

Amaral A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508–518 (2006)

Amaral A.R.S.: An exact approach for the one-dimensional facility layout problem. Oper. Res. 56, 1026–1033 (2008)

Amaral A.R.S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183–190 (2009)

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)

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)

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)

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)

Chung J., Tanchoco J.M.A.: The double row layout problem. Int. J. Prod. Res. 48(3), 709–727 (2010)

Coll P.E., Ribeiro C.C., Souza C.C.: Multiprocessor scheduling under precendence constraints: polyhedral results. Discrete Appl. Math. 154, 770–801 (2006)

de Alvarenga A.G., Negreiros-Gomes F.J., Mestria M.: Metaheuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11, 421–430 (2000)

Grötschel M., Jünger M., Reinelt G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32, 1195–1220 (1984)

Grötschel M., Jünger M., Reinelt G.: Facets of the linear ordering polytope. Math. Progr. 33, 43–60 (1985)

Grötschel M., Wakabayashi Y.: A cutting plane algorithm for a clustering problem. Math. Progr. Ser. B 45, 59–96 (1989)

Grötschel M., Wakabayashi Y.: Facets of the clique partitioning polytope. Math. Progr. 47, 367–387 (1990)

Heragu S.S.: Facilities Design, 2nd edn. iUniverse, Bloomington (2006)

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)

Heragu S.S., Kusiak A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258–268 (1988)

Heragu S.S., Kusiak A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53, 1–13 (1991)

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)

Love R.F., Wong J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139–143 (1976)

Picard J.-C., Queyranne M.: On the one-dimensional space allocation problem. Oper. Res. 29(2), 371–391 (1981)

Samarghandi H., Eshghi K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205, 98–105 (2010)

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)

Sherali H.D., Fraticelli B.M.P., Meller R.D.: Enhanced model formulations for optimal facility layout. Oper. Res. 51, 629–644 (2003)

Simmons D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17, 812–826 (1969)

Simmons D.M.: A further note on one-dimensional space allocation. Oper. Res. 19, 249 (1971)

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)