A new lower bound for the single row facility layout problem

Discrete Applied Mathematics

Volumn 157, Issue 1, 2009, Pages 183-190

  Amaral, André R S ^a  

^a FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

Author keywords

Facility layout; Linear arrangement; Polyhedral combinatorics

Indexed keywords

CONTROL THEORY; NUCLEAR PROPULSION; PLANT LAYOUT;

COMPUTATIONAL TESTS; COMPUTING TIMES; CUTTING PLANES; FACILITY LAYOUT; FACILITY LAYOUT PROBLEMS; FACILITY LAYOUTS; LINEAR ARRANGEMENT; LINEAR DESCRIPTIONS; LINEAR PROGRAMS; LOWER BOUNDS; NP-HARD PROBLEMS; OPTIMAL LAYOUTS; PARTIAL DESCRIPTIONS; POLYHEDRAL COMBINATORICS; POLYTOPE; VALID INEQUALITIES; WEIGHTED SUMS;

LINEAR PROGRAMMING;

EID: 56349117947     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.06.002     Document Type: Article

References (22)

1. Amaral A.R.S. On the exact solution of a facility layout problem. European Journal of Operational Research 173 (2006) 508-518
2. A.R.S. Amaral, An exact approach for the one-dimensional facility layout problem, Operations Research (2008) (in press)
3. A.R.S. Amaral, A.N. Letchford, A polyhedral approach to the single row facility layout problem, (2006) (submitted for publication)
4. Anjos M.F., Kennings A., and Vannelli A. A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optimization 2 (2005) 113-122
5. M.F. Anjos, A. Vannelli, Globally optimal solutions for large single-row facility layout problems, INFORMS Journal on Computing (2008) (in press)
6. Drezner Z. A heuristic procedure for the layout of a large number of facilities. Management Science 33 (1987) 907-915
7. Djellab H., and Gourgand M. A new heuristic procedure for the single-row facility layout problem. International Journal of Computer Integrated Manufacturing 14 (2001) 270-280
8. Garey M.R., and Johnson D.S. Computers and Intractability: An Introduction to the Theory of NP-Completeness (1979), Freeman, New York
9. Hall K.M. An r-dimensional quadratic placement algorithm. Management Science 17 (1970) 219-229
10. Heragu S.S., and Kusiak A. Machine layout problem in flexible manufacturing systems. Operations Research 36 (1988) 258-268
11. Heragu S.S., and Kusiak A. Efficient models for the facility layout problem. European Journal of Operational Research 53 (1991) 1-13
12. Heragu S.S., and Alfa A.S. Experiment analysis of simulated annealing based algorithms for the layout problem. European Journal of Operation Research 57 (1992) 190-202
13. Karp R.M., and Held M. Finite-state processes and dynamic programming. SIAM Journal of Applied Mathematics 15 (1967) 693-718
14. Kumar K.R., Hadjinicola G.C., and Lin T.L. A heuristic procedure for the single-row facility layout problem. European Journal of Operation Research 87 (1995) 65-73
15. Love R.F., and Wong J.Y. On solving a one-dimensional space allocation problem with integer programming. INFOR 14 (1976) 139-143
16. Neghabat F. An efficient equipment layout algorithm. Operation Research 22 (1974) 622-628
17. Nenhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), John Wiley & Sons
18. Picard J., and Queyranne M. On the one dimensional space allocation problem. Journal of Operation Research 29 (1981) 371-391
19. Romero D., and Sánchez-Flores A. Methods for the one-dimensional space allocation problem. Computers and Operations Research 17 (1990) 465-473
20. Simmons D.M. One-dimensional space allocation: An ordering algorithm. Operations Research 17 (1969) 812-826
21. Simmons D.M. A further note on one-dimensional space allocation. Operations Research 19 (1971) 249
22. M.B. Wright, A.R.S. Amaral, A. Camatta, Subset moves based simulated annealing applied to the layout problem, Presented at the 6th Metaheuristics International Conference, Vienna, 2005. Abstract available at http://www.univie.ac.at/mic2005/paperlistshort.htm#1175