An exact approach to the one-dimensional facility layout problem

Operations Research

Volumn 56, Issue 4, 2008, Pages 1026-1033

  Amaral, André R S ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ONE DIMENSIONAL; PLANT LAYOUT;

COMPUTATIONAL RESULTS; CONTINUOUS RELAXATIONS; CONVEX HULLS; EXACT APPROACHES; FACILITY LAYOUT PROBLEMS; LINEAR PROGRAMS; MINIMUM LINEAR ARRANGEMENTS; MIXED-INTEGER PROGRAMS; NP-HARD; OPTIMALITY; PROBLEM INSTANCES; QUADRATIC PROGRAMMING MODELS; QUADRATIC PROGRAMS; REDUNDANT CONSTRAINTS; WEIGHTED SUMS;

INTEGER PROGRAMMING;

EID: 61349094800     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0548     Document Type: Article

References (35)

1. Amaral, A. R. S. 2006. On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173 508-518.
2. Anjos, M. F., A. Kennings, A. Vannelli. 2005. A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2 113-122.
3. Balas, E. 1975. Disjunctive programming: Cutting planes from logical conditions. O. L. Mangasarian, R. R. Meyer, S. M. Robinson, eds. Non-Linear Programming, Vol. 2. Academic Press, New York, 279-312.
4. Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
5. Balas, E., S. Ceria, G. Cornuejols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58 295-324.
6. Balas, E., S. Ceria, G. Cornuejols. 1996. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42 1229-1246.
7. Chvátal, V. 1973. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 305-337.
8. Djellab, H., M. Gourgand. 2001. A new heuristic procedure for the single-row facility layout problem. Internat. J. Comput. Integrated Manufacturing 14 270-280.
9. Drezner, Z. 1987. A heuristic procedure for the layout of a large number of facilities. Management Sci. 33 907-915.
10. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: An Introduction to the Theory of NP-Completeness. Freeman, New York.
11. Gomory, R. E. 1958. Outline of an algorithm for integer solutions to linear programs. Bull. Amer: Math. Soc. 64 275-278.
12. Gomory, R. E. 1963. An algorithm for integer solutions to linear programs. R. L. Graves, P. Wolfe, eds. Recent Advances in Mathematical Programming. McGraw-Hill, New York, 269-302.
13. Grötschel, M., M. Jünger, G. Reinelt. 1985. Facets of the linear ordering polytope. Math. Programming 33 43-60.
14. Hall, K. M. 1970. An r-dimensional quadratic placement algorithm. Management Sci. 17 219-229.
15. Harper, L. H. 1964. Optimal assignment of numbers to vertices. SIAM J. Appl. Math. 12 131-135.
16. Heragu, S. S., A. S. Alfa. 1992. Experimental analysis of simulated annealing based algorithms for the facility layout problem. Eur. J. Oper: Res. 57 190-202.
17. Heragu, S. S., A. Kusiak. 1988. Machine layout problem in flexible manufacturing systems. Oper: Res. 36 258-268.
18. Heragu, S. S., A. Kusiak. 1991. Efficient models for the facility layout problem. Eur: J. Oper. Res. 53 1-13.
19. ILOG, Inc. 2003. CPLEX 8.0 User Manual. ILOG, Inc., Gentilly Cedex, France.
20. Karp, R. M., M. Held. 1967. Finite-state processes and dynamic programming. SIAM J. Appl. Math. 15 693-718.
21. Kumar, K. R., G. C. Hadjinicola, T. L. Lin. 1995. A heuristic procedure for the single row facility layout problem. Eur. J. Oper. Res. 87 65-73.
22. Lasserre, J. B. 2001. An explicit exact SDP relaxation for nonlinear 0-1 programs. K. Aardal, B. Gerards, eds. Lecture Notes in Computer-Science, Vol. 2081. Springer-Verlag, London, 293-303.
23. Lovász, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
24. Love, R. F., J. Y. Wong. 1976. On solving a one-dimensional allocation problem, with integer programming. Inform. Processing Oper. Res. (INFOR) 14 139-143.
25. Neghabat, F. 1974. An efficient equipment layout algorithm. Oper: Res. 22 622-628.
26. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
27. Nugent, C. E., T. E. Vollman, J. Rural. 1968. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16 150-173.
28. Picard, J., M. Queyranne. 1981. On the one-dimensional space allocation problem. Oper: Res. 29 371-391.
29. Romero, D., A. Sánchez-Flores. 1990. Methods for the one-dimensional space allocation problem. Comput. Oper: Res. 17 465-473.
30. Sherali, H. D., W. P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete. Math. 3 411-430.
31. Sherali, H. D., W. P. Adams. 1994. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52 83-106.
32. Sherali, H. D., Y. Lee. 1996. Tighter representation for set partitioning problems. Discrete Appl. Math. 68 153-168.
33. Simmons, D. M. 1969. One-dimensional space allocation: An ordering algorithm. Oper: Res. 17 812-826.
34. Simmons, D. M. 1971. A further note on one-dimensional space allocation. Oper: Res. 19 249.
35. Solimanpur, M., P. Vrat, R. Shankar. 2005. An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res. 32 583-598.