Network configuration and machine layout in fixed-path material handling systems

Annals of Operations Research

Volumn 76, Issue , 1998, Pages 21-54

  Al Sultan, Khaled S ^a   Bozer, Yavuz A ^b  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032396631     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018944520967     Document Type: Article

References (27)

1. K.S. Al-Sultan, A simulated annealing algorithm for the Multiple Choice Knapsack problem, presented at the ORSA/TIMS Joint Spring Meeting, Nashville, TN, May 1991.
2. K.S. Al-Sultan, Efficient global algorithms for hard and fuzzy clustering, unpublished M.S. Thesis, King Fahd University of Petroleum and Minerals, Saudi Arabia, 1987.
3. Ö. Bakkalbaşi and L.F. McGinnis, private communication.
4. M.S. Bazaraa, and J.J. Jarvis, Linear Programming and Network Flows, Wiley, New York, 1977.
5. Y.A. Bozer and S. Rim, Exact solution procedures for the circular layout problem, Technical Report 89-33, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109, 1989.
6. Y.A. Bozer and S. Rim, A branch and bound method for solving the bidirectional circular layout problem, Applied Mathematical Modelling 20(1996) 342-351.
7. V. Cerny, Thermodynamical approach to the Traveling Salesman Problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications 45(1985)41-51.
8. G.W. Evans, M.R. Wilhelm and J.S. Usher, A modular algorithm for pre-simulation design of Automatic Guided Vehicle systems, Proceedings of the 1990 Material Handling Research Colloquium, Hebron, KY, June 19-21, 1990, pp. 333-340.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
10. R.J. Gaskins and J.M.A. Tanchoco, Flow path design for Automated Guided Vehicle systems, International Journal of Production Research 25(1987)667-676.
11. W.G. Goetz, Jr. and P.J. Egbelu, Guide path design and location of pick-up/drop-off points for an Automated Guided Vehicle system, International Journal of Production Research 28(1990)927-942.
12. B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13(1988) 311-329.
13. S.S. Heragu and A. Kusiak, Machine layout problem in flexible manufacturing systems, Operations Research 36(1988)258-268.
14. M. Kaspi and J.M.A. Tanchoco, Optimal flow path design of unidirectional AGV systems, International Journal of Production Research 28(1990)1023-1030.
15. A.S. Kiran, A.T. Unal and S. Karabati, A location problem on unicyclic networks: Balanced case, Working Paper 89-11, Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, 1989.
16. S. Kirkpatrick, C. Gelatt and M. Vecchi, Optimization by simulated annealing, Science 20(1983) 671-680.
17. P. Kouvelis and M.W. Kim, Unidirectional loop network layout problem in automated manufacturing systems, Operations Research 40(1992)533-550.
18. P. Kouvelis and W.C. Chiang, Linear single-row machine layout in automated manufacturing systems, Working Paper 89/90-4-3, Department of Management, The University of Texas at Austin, 1989.
19. J. Leung, A graph-theoretic heuristic for designing loop-layout manufacturing systems, Technical Report 90-12, Department of Operations Research, Yale University, New Haven, CT 06511, 1990.
20. M. Lundy and A, Mees, Convergence of an annealing algorithm, Mathematical Programming 34 (1986)111-124.
21. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth and A.H. Teller, Equation of state calculation by fast computing machines, The Journal of Chemical Physics 21(1953)1087-1092.
22. J.C. Picard and M. Queyranne, On the one-dimensional space allocation problem, Operations Research 29(1981)371-391.
23. F. Romeo and A. Sangiovanni-Vincentelli, Probabilistic hill climbing algorithms: Properties and applications, Memorandum No. UCB/ERL M84/34, UC Berkeley, March 1984.
24. R. Tarjan, Depth-first search and linear graph algorithms, SIAM Jour. Comput. 1(1972)146-160.
25. J.A. Tompkins, J.A. White, Y.A. Bozer, E.H. Frazelle, J.M.A. Tanchoco and J. Trevino, Facilities Planning, 2nd ed., Wiley, 1996.
26. M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, HE Transactions 19(1987)107-119.
27. J.Y. Yen, An algorithm for finding shortest routes from all source nodes to a given destination in general networks, Quarterly of Applied Mathematics 27(1969)526-530.