[1] Tompkins JA, White JA, BozerYA, et al. Facilities planning[M]. NewYork: Wiley, 1996. [2] Ulutas B H, Islier A A. A clonal selection algorithm for dynamic facility layout problems[J]. Journal of Manufacturing Systems, 2009, 28(4): 123-131. [3] McKendall Jr A R., Shang Jin. Hybrid ant systems for the dynamic facility layout problem[J]. 2006, 33(3): 790-803. [4] Shore R H, Tompkins J A. Flexible facilities design[J]. AⅡE Transactions, 1980, 12(2): 200-205. [5] Gupta T, Seifoddini H. Production data based similarity coefficient for machine-component grouping decisions in the design of cellular manufacturing system[J]. International Journal of Production Research, 1990, 28(7):1247-1269. [6] Liggett R S. Automated facilities layout: Past, present and future[J]. Automation in Construction, 2000, 9(2):197-215. [7] 王盈, 吴正佳, 王魁. 锯片制造车间设施规划设计[J]. 机械设计与制造, 2008, 1: 229-230. [8] 董海, 计算机仿真技术在设施规划与设计中的应用[J]. 沈阳大学学报. 2004, 16 (4): 35-37. [9] 王凤仙, 王英利. 基于SLP法对网卡车间的物流研究与设施规划[J]. 内蒙古科技与经济, 2009, 9: 129-131. [10] 韩庆兰. 物流设施规划的多目标优化模型[J]. 控制与决策, 2006, 8: 957-960. [11] 马彤兵, 马可. 基于精益生产的车间设施规划改善设计[J]. 组合机床与自动化加工技术, 2005, 6: 110-112. [12] Rosenbaltt M J. The dynamics of plant layout[J]. Management Science, 1986, 32(1):76-85. [13] Lacksonen T A, Enscore E E. Quadratic assignment algorithms for the dynamic layout problem[J]. International Journal of Production Research, 1993, 31(3):503-517. [14] Urban T L. A heuristic for the dynamic facility layout problem[J]. ⅡE Transactions 1993, 25(4): 57-63. [15] Balakrishnan J, Cheng C H, Conway G. An improved pair-wise exchange heuristic for the dynamic plant layout problem[J]. International Journal of Production Research, 2000, 38(13): 3067-3077. [16] Conway D G, Venkataramanan M A. Genetic search and the dynamic facility layout problem[J]. Computers and Operations Research, 1994, 21(8):955-960. [17] Balakrishnan J, Cheng C H, Conway D G, et al. A hybrid genetic algorithm for the dynamic plant layout problem[J]. International Journal of Production Economics, 2003, 86(2): 107-120. [18] Kaku B K, Mazzola J B.A tabu search heuristic for the dynamic plant layout problem[J]. INFORMS: Journal on Computing, 1997, 9(4):374-384. [19] Baykasoglu A, Gindy N N Z. A simulated annealing algorithm for dynamic layout problem[J]. Computers and Operations Research, 2001, 28(4):1403-1426. [20] Erel E, Ghosh J B, Simon J T. New heuristic for the dynamic layout problem[J]. Journal of the Operational Research Society, 2003, 54(12):1202-1275. [21] Kochhar J S, Heragu S S. Facility layout design in a changing environment[J]. International Journal of Production Research, 1999, 37 (11): 2429-2446. [22] Balakrishnan J, Cheng C H. Dynamic layout algorithms: a state-of-the-art survey[J]. Omega: International Journal of Management Science, 1998, 26: 507-21. [23] Balakrishnan J, Jacobs F R, Venkataramanan M A. Solutions for the constrained dynamic facility layout problem[J]. European Journal of Operational Research, 1992, 57(2): 280-286. [24] McKendall Jr A R., Shang Jin, Kuppusamy S. Simulated annealing heuristics for the dynamic facility layout problem[J]. Computers & Operations Research, 2006, 33(8): 2431-2444. [25] Dorigo M, Maniezzo V, Colorni A. Positive feedback as a search strategy[R]. Technical Report, 1991. [26] Baykasoglu A, Dereli T, Sabuncu I. An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems[J]. The International Journal of Management Science, 2006, 34(4): 385-396. [27] Kirkpatrick S, Gelatt C D, Vecchi M P. Optimization by simulated annealing[J]. Science, 1983, 220(4598):671-80. [28] Wilhelm M R, Ward T L. Solving quadratic assignment problems by simulated annealing[J]. ⅡE Transactions, 1987, 19(1): 107-19. [29] Baykasoglu A, Gindy N N Z.Asimulated annealing algorithm for dynamic facility layout problem[J]. Computers&Operations Research, 2001, 28(14): 1403-26. [30] Balakrishnan J, Cheng C H. Genetic search and the dynamic layout problem[J]. Computers & Operations Research, 2000, 27(6):587-93. |