Single-row equidistant facility layout as a special case of single-row facility layout

International Journal of Production Research

Volumn 52, Issue 5, 2014, Pages 1257-1268

  Hungerländer, Philipp ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

machine location; quadratic assignment problem; quadratic ordering problem; semidefinite optimisation; single row facility layout; space allocation

Indexed keywords

EID: 84893977699     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2013.828163     Document Type: Article

References (87)

1. Adolphson, D. 1977. "Singlemachine Job Sequencing with Precedence Constraints." SIAM Journal on Computing 6 : 40-54.
2. Altinel, I. K., and T. Öncan. 2005. "Design of Unidirectional Cyclic Layouts." International Journal of Production Research 43 (19): 3983-4008.
3. Amaral,A. R. S. 2006. "On the Exact Solution of a Facility Layout Problem." European Journal of Operational Research 173 (2): 508-518.
4. Amaral, A. R. S. 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem." Operations Research 56 (4): 1026-1033. doi:10.1287/opre.1080.0548.
5. Amaral, A. R. S. 2009. "A New Lower Bound for the Single Row Facility Layout Problem." Discrete Applied Mathematics 157 (1): 183-190.
6. Amaral, A. R. S., and A. N. Letchford. 2012. "A Polyhedral Approach to the Single Row Facility Layout Problem". Mathematical Programming, 1-25. Available online.
7. Aneke, N. A. G., and A. S. Carrie. 1986. "A Design Technique for the Layout of Multi-product Flowlines." International Journal of Production Research 24 (3): 471-481.
8. Anjos, M. F.,A. Kennings, andA.Vannelli. 2005. "ASemidefinite OptimizationApproach for the Single-row Layout Problem with Unequal Dimensions." Discrete Optimization 2 (2): 113-122.
9. Anjos, M. F., and J. B. Lasserre (eds.). 2011. Handbook on Semidefinite, Conic and Polynomial Optimization Theory, Algorithms, Software and Applications. International Series in Operations Research & Management Science. New York: Springer-Verlag.
10. Anjos, M. F., and A. Vannelli. 2008. "Computing Globally Optimal Solutions for Single-row Layout Problems Using Semidefinite Programming and Cutting Planes." INFORMS Journal On Computing 20 (4): 611-617.
11. Anjos, M. F., and G. Yen. 2009. "Provably Near-optimal Solutions for Very Large Single-row Facility Layout Problems." Optimization Methods and Software 24 (4): 805-817.
12. Bhasker, J., and S. Sahni. 1987. "Optimal LinearArrangement of CircuitComponents." Proceedings of the 20thAnnual Hawaii International Conference on System Sciences 2: 99-111.
13. Bornstein, C. F., and S. Vempala. 2004. "Flow Metrics." Theoretical Computer Science 321 : 13-24.
14. Boyd, S., and L. Vandenberghe. 2004. Convex Optimization. New York: Cambridge University Press.
15. Buchheim, C., A. Wiegele, and L. Zheng. 2010. "Exact Algorithms for the Quadratic Linear Ordering Problem." INFORMS Journal on Computing 22 (1): 168-177.
16. Caprara, A., M. Jung, M. Oswald, G. Reinelt, and E. Traversi. 2011. "Optimal Linear Arrangements Using Betweenness Variables." Mathematical Programming Computation 3 (3): 261-280.
17. Caprara, A., A. N. Letchford, and J. Salazar-González. 2011. "Decorous Lower Bounds for Minimum Linear Arrangement." INFORMS Journal on Computing 23 (1): 26-40.
18. Charikar,M., M. T. Hajiaghayi, H. Karloff, and S. Rao. 2006. "l22 SpreadingMetrics for Vertex Ordering Problems." In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA '06, 1018-1027, New York.
19. Chen, P. P.-S. 1976. "The Entity-relationship Model-toward a Unified View of Data." ACM Transactions on Database Systems 1 : 9-36.
20. Chimani, M., and P. Hungerländer. 2012a. "Multi-Level Verticality Optimization: Concept, Strategies, and Drawing Scheme." Journal of Graph Algorithms and Applications. Accepted, preprint. http://www.ae.uni- jena.de/Research-Pubs/MLVO.html
21. Chimani, M., and P. Hungerländer. 2012b. "Exact Approaches to Multi-Level Vertical Orderings." INFORMS Journal on Computing. Accepted, preprint. http://www.ae.uni-jena.de/Research-Pubs/MLVO.html
22. Chimani, M., P. Hungerländer, M. Jünger, and P.Mutzel. 2011. "An SDPApproach to Multi-level Crossing Minimization." In Proceedings of Algorithm Engineering & Experiments [ALENEX'2011], 116-126. San Francisco, CA.
23. Chow, W.-M. 1986. "An Analysis of Automated Storage and Retrieval Systems in Manufacturing Assembly Lines." IIE Transactions 18 (2): 204-214.
24. Christofides, N., and E. Benavent. 1989. "An Exact Algorithm for the Quadratic Assignment Problem on a Tree." Operations Research 37 (5): 760-768.
25. Datta, D., A. R. S. Amaral, and J. R. Figueira. 2011. "Single Row Facility Layout Problem using a Permutation-based Genetic Algorithm." European Journal of Operational Research 213 (2): 388-394.
26. Díaz, J., J. Petit, and M. Serna. 2002. "A Survey of Graph Layout Problems." ACM Computing Surveys 34 : 313-356.
27. Drezner, Z. 2006. "Finding a Cluster of Points and the Grey Pattern Quadratic Assignment Problem." OR Spectrum 28 : 417-436.
28. Feige, U., and J. R. Lee. 2007. "An ImprovedApproximationRatio for the Minimum LinearArrangement Problem." Information Processing Letters 101 : 26-29.
29. Fischer, I., G. Gruber, F. Rendl, and R. Sotirov. 2006. "Computational Experience with a Bundle Method for Semidefinite Cutten Plane Relaxations of Max-cut and Equipartition." Mathematical Programming 105: 451-469.
30. Gane, C. P., and T. Sarson. 1979. Structured Systems Analysis: Tools and Techniques. 1st ed. Englewood Cliffs, NJ: Prentice Hall Professional Technical Reference.
31. Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. New York: W. H. Freeman & Co.
32. Garey, M. R., D. S. Johnson, and L. Stockmeyer. 1974. "Some Simplified NP-complete Problems." In STOC '74: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, 47-63, New York.
33. Goemans, M., and D. Williamson. 1995. "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems using Semidefinite Programming." Journal of the ACM 42 : 1115-1145.
34. Gomes de Alvarenga, A., F. J. Negreiros-Gomes, and M. Mestria. 2000. "Metaheuristic Methods for a Class of the Facility Layout Problem." Journal of Intelligent Manufacturing 11 : 421-430.
35. Hall, K. M. 1970. "An r-dimensional Quadratic Placement Algorithm." Management Science 17 (3): 219-229.
36. Harper, L. H. 1964. "Optimal Assignments of Numbers to Vertices." SIAM Journal on Applied Mathematics 12 : 131-135.
37. Harper, L. H. 1966. "Optimal Numberings and Isoperimetric Problems on Graphs." Journal of Combinatorial Theory 1: 385-393.
38. Helmberg, C. 2000. "Fixing Variables in Semidefinite Relaxations." SIAM Journal on Matrix Analysis and Applications 21 (3): 952-969.
39. Helmberg, C., F. Rendl, R.Vanderbei, and H.Wolkowicz. 1996. "An Interior-point Method for Semidefinite Programming." SIAM Journal on Optimization 6 : 342-361.
40. Heragu, S. S., and A. S. Alfa. 1992. "Experimental Analysis of Simulated Annealing Based Algorithms for the Layout Problem." European Journal of Operational Research 57 (2): 190-202.
41. Heragu, S. S., and A. Kusiak. 1988. "Machine Layout Problem in Flexible Manufacturing Systems." Operations Research 36 (2): 258-268.
42. Heragu, S. S., and A. Kusiak. 1991. "Efficient Models for the Facility Layout Problem." European Journal of Operational Research 53 (1): 1-13.
43. Hungerländer, P. 2012. "Semidefinite Approaches to Ordering Problems." PhD thesis, Alpen-Adria Universität Klagenfurt.
44. Hungerländer, P., and M. Anjos. 2012. A Semidefinite Optimization Approach to Space-free Multi-row Facility Layout. Cahier du GERAD G-2012-03, GERAD, Montreal, QC, Canada.
45. Hungerländer, P., and F. Rendl. 2013b. "A Computational Study and Survey of Methods for the Single-row Facility Layout Problem." Computational Optimization and Applications 55 (1): 1-20.
46. Hungerländer, P., and F. Rendl. 2013a. "Semidefinite Relaxations of Ordering Problems." Mathematical Programming 140 (1): 77-97.
47. Juvan, M., and B. Mohar. 1992. "Optimal Linear Labelings and Eigenvalues of Graphs." Discrete Applied Mathematics 36 (2): 153-168.
48. Karp, R. M. 1993. "Mapping the Genome: Some Combinatorial ProblemsArising in Molecular Biology." In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC '93, 278-285, New York: ACM.
49. Karp, R. M., and M. Held. 1967. "Finite-state Processes and Dynamic Programming." SIAM Journal on Applied Mathematics 15 (3): 693-718.
50. Koopmans, T. C., andM. Beckmann. 1957. "Assignment Problems and the Location of Economic Activities." Econometrica 25 (1): 53-76.
51. Koren, Y., and D. Harel. 2002. "A Multi-scale Algorithm for the Linear Arrangement Problem." In Revised Papers from the 28th International Workshop on Graph-theoretic Concepts in Computer Science,WG '02, 296-309, London: Springer-Verlag.
52. Kouvelis, P.,W.-C. Chiang, and G. Yu. 1995. "Optimal Algorithms for Row Layout Problems in Automated Manufacturing Systems." IIE Transactions 27 (1): 99-104.
53. Kouvelis, P., and M. W. Kim. 1992. "Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems." Operations Research 40 : 533-550.
54. Kumar, K. R., G. C. Hadjinicola, and T.-L. Lin. 1995. "A Heuristic Procedure for the Single-row Facility Layout Problem." European Journal of Operational Research 87 (1): 65-73.
55. Lovász, L., and A. Schrijver. 1991. "Cones of Matrices and Set-functions and 0-1 Optimization." SIAM Journal on Optimization 1 : 166-190.
56. Love, R. F., and J. Y. Wong. 1967. "On Solving a One-dimensional Space Allocation Problem with Integer Programming." INFOR 14: 139-143.
57. McAllister, A. J. 1999. "ANew Heuristic Algorithm for the Linear Arrangement Problem." Technical report, University of New Brunswick, Faculty of Computer Science, TR-99-126a.
58. Meller, R., and K.-Y. Gau. 1996. "The Facility Layout Problem: Recent and Emerging Trends and Perspectives." Journal of Manufacturing Systems 5 (5): 351-366.
59. Mitchison, G., and R. Durbin. 1986. "Optimal Numberings of an N N Array." SIAM Journal on Algebraic and Discrete Methods 7 : 571-582.
60. Nori, V. S., and B. R. Sarker. 1997. "Designing Multi-product Lines: Job Routing in Cellular Manufacturing Systems." Journal of the Operational Research Society 48 (4): 412-422.
61. Nugent, C. E., T. E. Vollmann, and J. Ruml. 1968. "An Experimental Comparison of Techniques for the Assignment of Facilities to Locations." Operations Research 16 (1): 150-173.
62. Obata, T. 1979. "Quadratic Assignment Problem: Evaluation of Exact and Heuristic Algorithms." PhD thesis, Rensselaer Polytechnic Institute, Troy, NY.
63. Palubeckis, G. 2012. "A Branch-And-bound Algorithm for the Single-row Equidistant Facility Layout Problem." OR Spectrum 34 : 1-21.
64. Petit, J. 2003a. "Combining Spectral Sequencing and Parallel Simulated Annealing for the MinLA Problem." Parallel Processing Letters 13 (1): 77-91.
65. Petit, J. 2003b. "Experiments on the Minimum Linear Arrangement Problem." ACM Journal of Experimental Algorithmics 8.
66. Picard, J.-C., and M. Queyranne. 1981. "On the One-dimensional Space Allocation Problem." Operations Research 29 (2): 371-391.
67. Rao, S., and A.W. Richa. 2005. "New Approximation Techniques for Some Linear Ordering Problems." SIAM Journal on Computing 34 : 388-404.
68. Ravi, R., A. Agrawal, and P. Klein. 1991. "Ordering Problems Approximated: Single-processor Scheduling and Interval Graphs Connection." In 18th International Colloquium on Automata, Languages and Programming, Vol. 150 of Lecture Notes in Computer Science, edited by J. L. Albert, B. R. Artalejo, and B. Monien, 751-762. New York: Springer-Verlag.
69. Rendl, F., G. Rinaldi, and A. Wiegele. 2010. "Solving Max-cut to Optimality by Intersecting Semidefinite and Polyhedral Relaxations." Mathematical Programming 212 : 307-335.
70. Rodriguez-Tello, E., J.-K. Hao, and J. Torres-Jimenez. 2008. "An Effective Two-stage Simulated Annealing Algorithm for the Minimum Linear Arrangement Problem." Computers & Operations Research 35 : 3331-3346.
71. Romero, D., and A. Sánchez-Flores. 1990. "Methods for the One-dimensional Space Allocation Problem." Computers & Operations Research 17 (5): 465-473.
72. Samarghandi, H., and K. Eshghi. 2010. "An Efficient Tabu Algorithm for the Single Row Facility Layout Problem." European Journal of Operational Research 205 (1): 98-105.
73. Sarker, B.,W.Wilhelm, and G. Hogg. 1998. "One-Dimensional Machine Location Problems in a Multi-product Flowline with Equidistant Locations." European Journal of Operational Research 105 (3): 401-426.
74. Sarker, B. R. 1989. "The Amoebic Matrix and One-dimensional Machine Location Problems." PhD thesis, Department of Industrial Engineering, Texas A&M University, College Station, TX.
75. Sarker, B. R., and Y. Xu. 2000. "Designing Multi-product Lines: Job Routing in Cellular Manufacturing Systems." IIE Transactions 32 : 219-235.
76. Sarker, B. R., and J. Yu. 1994. "A Two-phase Procedure for Duplicating Bottleneck Machines in a Linear Layout, Cellular Manufacturing System." International Journal of Production Research 32 (9): 2049-2066.
77. Schwarz, R. 2010. "A Branch-And-Cut Algorithm with Betweenness Variables for the Linear Arrangement Problems." Diploma thesis, Heidelberg.
78. Simmons, D. M. 1969. "One-dimensional Space Allocation: An Ordering Algorithm." Operations Research 17 : 812-826.
79. Simmons, D. M. 1971. "A Further Note on One-dimensional Space Allocation." Operations Research 19 : 249.
80. Suryanarayanan, J., B. Golden, and Q. Wang. 1991. "A New Heuristic for the Linear Placement Problem." Computers & Operations Research 18 (3): 255-262.
81. Tucker, A.W. 1960. "On Directed Graphs and Integer Programs." Technical report, IBM Mathematical Research Project.
82. Vanelli, A., and G. S. Rowan. 1986. "An Eigenvector BasedApproach forMultistack VLSI layout." Proceedings of theMidwest Symposium on Circuits and Systems 29 : 135-139.
83. Wang, S., and B. R. Sarker. 2002. "Locating Cells with Bottleneck Machines in Cellular Manufacturing Systems." International Journal of Production Research 40 (2): 403-424.
84. 2000. Handbook of Semidefinite Programming. Boston, MA: Kluwer Academic.
85. Younger, D. H. 1963. "Minimum Feedback Arc Sets for a Directed Graph." IEEE Transactions on Circuit Theory 10 (2): 238-245.
86. Yu, J. 1999. "Machine-cell Location Problems for Multi-product Flowlines." PhD thesis, Department of Industrial and Manufacturing Systems Engineering, Louisiana State University, Baton Rouge.
87. Yu, J., and B. R. Sarker. 2003. "Directional Decomposition Heuristic for a Linear Machine-cell Location Problem." European Journal of Operational Research 149 (1): 142-184.