离散型企业动态空间布局调度研究
|
摘要
在生产大型产品的离散型制造企业中,产品组装的特点决定了其装配过程是其发展中的一个瓶颈过程。能否解决好这一问题,是有效利用企业现有资源、合理制定企业生产计划、提高客户满意度、增强企业竞争力的关键。离散型制造企业中产品组装的问题是布局和调度相结合在一起的复杂问题,目前国内外学者对其研究较少,要解决这一难题,还需要大量的工作。本文针对这个问题进行了研究,取得了一定成果。
论文首先对离散型制造企业中大型产品组装这个问题进行了分析,提出了解决问题的实用性和价值性;其次介绍了国内外车间调度问题和布局问题的研究方法和发展现状,引出了动态空间调度的问题,同时阐述了求解动态空间调度问题所需要的一系列基本理论。
在动态空间调度问题的求解过程中,论文基于人工智能理论,对产品组装问题进行了一定的简化,建立了调度模型,同时提出了一种基于树搜索的动态调度方法。该方法同时考虑了空间布置和时间调度两方面因素,在整个调度规划周期内,算法分成两部分:一是调度准备阶段,把调度时间分割成连续的时间段,并通过时间约束条件得到在每个分场地内需要组装的组件候选集,同时得到分场地的初始布局状态;二是局部调度阶段,通过深度优先树搜索方法,在每个时间段内使用局部调度算法进行空间布置搜索,得出相对较优的调度结果。最后将基于树搜索的动态空间调度算法与多层回溯策略相结合,进一步得到一种修正的动态空间调度算法。两种方法都采用Matlab强大的数值计算能力进行了模拟试验,试验结果表
明所提出方法的有效性;并通过对工作空间参数的改变和时间耗费情况的分析对比,说明修正的动态空间调度算法在时间复杂度增长较小的情况下可以得出较好优化的调度结果。
Product assembling in discrete corporation produce large-scale products is a bottleneck process. Whether or not to solve this problem, it’s a key to utilize the resource of the corporation effectively, set down the production program reasonable and improve the satisfaction of customers. Product assembling is a complicate problem combined layout and scheduling, and there are a few scholars study on it. It needs large numbers of work to solve this difficult problem. This paper analyzes the problem and gets some fruits.
First this paper analyzes the product assembling problem for large-scale product in discrete corporation, and then proposes the pressure and practicability of solving this problem. Next it introduces the researching methods and states of the problem, then the dynamic spatial scheduling problem is educed, and a series of fundamental theories of solving dynamic spatial scheduling problem is illuminated.
During the solving process of dynamic spatial scheduling problem, a spatial scheduling method on Tree-Search is proposed. The method is divided into two parts: First is the pre-schedule stage, the scheduling time is separated into the continual time-slices, and the block candidate set is got via the time constraint, the initial layout status is given at the same time; Second is the partial scheduling stage, with the Depth First Search, we perform the spatial layout search by the partial schedule algorithm in every time-slice, in order to get a preferable scheduling plan. At last we combine the spatial scheduling algorithm on Tree-Search with multilayer backtracking strategy, through that we can get a correctional dynamic spatial algorithm.
Both of the two methods adopt strong ability of Matlab’s numerical calculation to do simulated experiment, and the results of experiment testified the validity of the proposed methods; the analysis of contrast of changing of the spatial parameter and time expending, shows the correctional dynamic spatial algorithm can get a comparatively optimal scheduling result on the condition of the increasing frequency of time complexity is slow.
论文首先对离散型制造企业中大型产品组装这个问题进行了分析,提出了解决问题的实用性和价值性;其次介绍了国内外车间调度问题和布局问题的研究方法和发展现状,引出了动态空间调度的问题,同时阐述了求解动态空间调度问题所需要的一系列基本理论。
在动态空间调度问题的求解过程中,论文基于人工智能理论,对产品组装问题进行了一定的简化,建立了调度模型,同时提出了一种基于树搜索的动态调度方法。该方法同时考虑了空间布置和时间调度两方面因素,在整个调度规划周期内,算法分成两部分:一是调度准备阶段,把调度时间分割成连续的时间段,并通过时间约束条件得到在每个分场地内需要组装的组件候选集,同时得到分场地的初始布局状态;二是局部调度阶段,通过深度优先树搜索方法,在每个时间段内使用局部调度算法进行空间布置搜索,得出相对较优的调度结果。最后将基于树搜索的动态空间调度算法与多层回溯策略相结合,进一步得到一种修正的动态空间调度算法。两种方法都采用Matlab强大的数值计算能力进行了模拟试验,试验结果表
明所提出方法的有效性;并通过对工作空间参数的改变和时间耗费情况的分析对比,说明修正的动态空间调度算法在时间复杂度增长较小的情况下可以得出较好优化的调度结果。
Product assembling in discrete corporation produce large-scale products is a bottleneck process. Whether or not to solve this problem, it’s a key to utilize the resource of the corporation effectively, set down the production program reasonable and improve the satisfaction of customers. Product assembling is a complicate problem combined layout and scheduling, and there are a few scholars study on it. It needs large numbers of work to solve this difficult problem. This paper analyzes the problem and gets some fruits.
First this paper analyzes the product assembling problem for large-scale product in discrete corporation, and then proposes the pressure and practicability of solving this problem. Next it introduces the researching methods and states of the problem, then the dynamic spatial scheduling problem is educed, and a series of fundamental theories of solving dynamic spatial scheduling problem is illuminated.
During the solving process of dynamic spatial scheduling problem, a spatial scheduling method on Tree-Search is proposed. The method is divided into two parts: First is the pre-schedule stage, the scheduling time is separated into the continual time-slices, and the block candidate set is got via the time constraint, the initial layout status is given at the same time; Second is the partial scheduling stage, with the Depth First Search, we perform the spatial layout search by the partial schedule algorithm in every time-slice, in order to get a preferable scheduling plan. At last we combine the spatial scheduling algorithm on Tree-Search with multilayer backtracking strategy, through that we can get a correctional dynamic spatial algorithm.
Both of the two methods adopt strong ability of Matlab’s numerical calculation to do simulated experiment, and the results of experiment testified the validity of the proposed methods; the analysis of contrast of changing of the spatial parameter and time expending, shows the correctional dynamic spatial algorithm can get a comparatively optimal scheduling result on the condition of the increasing frequency of time complexity is slow.
引文
[1]刘敏,鲁建厦,离散型制造企业物流管理信息系统研究,机械工程师,2003,9:30-34
[2]造船过程——挑战和机遇,IBM 产品生命周期管理资源白皮书,2002,1:19-25
[3]S.M.Johnson, Optimal Two- and Three- Stage Production Scheduling with Set-up Times Included, Naval Research Logistics Quarterly, 1954, 1:61-68
[4] Story, A.E., Wagner, H. M., Computational Experience whit Integer Programming for Job-shop Scheduling, Industrial Scheduling, Chap.14, Prentice-Hall, 1963
[5] Gavett, J. W., Three Heuristic Rules for Sequencing Jobs to a Single Production Facility, Mgmt.Sci., 1965 ,11:166-176
[6] S.Panwalker, Wafilc Iskander., A Survey of Scheduling, Ops. Res., 1997, 25(1):45-61
[7] Stephen, C.Graves, A Review of Production Scheduling, Ops. Res., 1981, 29(4):646-675
[8] M. S. Fox., ISIS: A Retrospective. Intelligent Scheduling, Kaufmann, Michael B. Morgan, 1994:3-28
[9] F. A. Rodammer, K.P. White, Jr., A Recent Survey of Production scheduling, IEEE Transactions on Systems, Man, and Cybernetics, 1988, 18(6):841-851
[10] 王凌,车间调度及其遗传算法,清华大学出版社,2003
[11] 徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述,计算机研究与发展,2004,41(2):257-267
[12] Feng-Tse Lin, Constructing A Job-Shop Scheduling Model Based on Imprecise Data , The IEEE International Conference on Fuzzy Systems, 2003, 1374-1379
[13] 彭志刚,吴广宇,杨艳丽,徐心,一机两流的连铸生产计划模型与算法,东北大学学报,2000, 21(3): 244-246
[14] 余琦玮,基于遗传算法的作业车间调度问题研究:[硕士学位论文],浙江:浙江大学机械与能源工程学院,2004
[15] 陈东升,基于遗传算法的模糊车间作业调度问题的研究:[硕士学位论文],大连:大连理工大学机械电子工程系,2005
[16] 徐本强,车间调度的 Mas 智能决策技术研究与应用:[硕士学位论文],大连:大连海事大学计算机学院,2004
[17] 赵巍,基于多智能体的生产调度方法及其应用:[硕士学位论文],浙江:浙江工业大学,2004
[18] 朱红,用 DNA 算法求解车间调度问题的研究:[硕士学位论文],黑龙江:哈尔滨理工大学计算机与控制学院,2005
[19]耿兆强,邹益仁,基于遗传算法的作业车间模糊调度问题的研究,计算机集成制造系统-CIMS,2002.8(8): 616-620
[20]张旭,具有拓扑结构布局优化的理论及算法,[博士学位论文],大连,大连理工大学,2004.4
[21]Kenndy M P, Chua L O., Unifying the tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of chua and lin, IEEE Transactions on Circuits and Systems, 1987, CAS-34 (2): 210-214
[22]Kathryn A Dowsland, William B Dowsland, Packing Problems, Eur. J. of OR, 1992, 56 (1): 2- 14
[23] P.C.Gilinore, R.E_Gomory, A linear programming approach to the cutting stock problem, Operational Research, 1961, 9: 848-859
[24]P.C.Gilmore, R.E.Gomory, A linear programming approach to the cutting stock problem, Part2, Operational Research, 1963, 11: 863-888
[25]P.C.Gilmore, R.E.Gomory, Multistage cutting stock problem of two and more dimensions, Operational Research, 1965, 13: 94-120
[26]Garey M R, Johnson D S, Computers and Intractability: a Guide to the Theory of NP2 Completeness, SanFrancisco: Freeman, 1979
[27]Christophides N, Whitlock C, An algorithm for two-dimensional cutting stock problems, Operations Research, 1977, 25(1): 30-44
[28]Morabito R N, Arenales M N, Arcoro V F, Staged and constrained two-dimensional guillotine cutting problems: An AND/ OR-graph approach, European Journal of operational Research, 1996, 94: 548-560
[29]Hadjiconstantinou E, Christofides N., An exact algorithm for general, orthogonal, two-dimensional knapsack problems, European Journal of Operational Research, 1995, 83 (1): 39-56
[30] Bhattacharya S, Roy R, Bhattacharya S., An exact depth-first algorithm for the pallet-loading problem, European Journal of Operational Research, 1998,110 (3): 610-625
[31]Wang P Y., Two algorithms for constrained two-dimensional cutting stock problems, Operations Research, 1983, 31:573-386
[32]Beasley J E., An exact two-dimensional non-guillotine cutting tree search procedure, Operational Research, 1985, 33: 49-64
[33]Younis N A, Cavalier T M., On locating part bins in a constrained layout area for an automated assembly process, Computers&Industrial Engineering, 1990, 18 (2):111-118
[34]Murata H, Fujiyoshi K, Nakatake S, Kajitani Y, Rectangle-packing-based module placement, IEEE/ACM International Conference on Computer-Aided Design, Digest of Tactical Papers, IEEE, 1995: 472-479
[35] Hwang S, Kao C, Horng J, On solving rectangle bin packing problems using genetic algorithms, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1994: 1583-1590
[36] Jakobs S, On genetic algorithms for the packing of polygons, European Journal of Operational Research, 1996, 88 (1): 165-181
[37] Georgis N, Petrou M, Kittler J, On the constrained rectangle packing problem, International Journal of Modelling and Simulation, 2000,20(4): 293-299
[38]张春鸿,刘美伦,装箱问题在积木块布局中的应用,计算机学报,1987,5: 303-309
[39]徐雷,一类新的聚类分析算法:模拟退火算法,模式识别与人工智能,1989,2(1),11-16
[40]徐雷,模拟退火组合优化法在模式识别中的若干应用,自动化学报,1989, 15(2): 114-121
[41]许建国,二维松弛布局方法,计算机学报,1990, 3: 207-214
[42]曹炬,周济,冲裁件排样最优化的数学模型计算法,锻压技术,1993,6: 21-24
[43]曹炬,周济,冲裁件排样中对头双排的优化算法与实现,机械工业自动化,1994, 16(4): 24-26
[44]黄文奇,詹叔浩,求解 Packing 问题的拟物方法,应用数学学报,1979, 2(2): 176-180
[45]黄文奇,Packing 问题的拟物方法,应用数学学报,1986, 9(4): 443-453
[46]戴佐,查建中,袁俊良,一种基于八叉树表达的三维实体布局启发式算法,软件学报,1996,6(20): 629-636
[47]戴佐,查建中,袁俊良.三维实体布局中干涉检验的八叉树方法,计算机辅助设计和图形学,1995, 7(4): 257-262
[48]王金敏,查建中等.复杂物体间的距离,计算机辅助设计与图形学学报,1997, 9(1): 14-19
[49]戴佐,查建中,面向任意形状布局物体的启发式算法,计算机辅助设计与图形学学报,1995,7(10): 630-634
[50]王金敏,马丰宁,一种基于约束的布局求解方法,计算机辅助设计与图形学学报,1998, 10(2): 156-160
[51]王金敏,王玉新,查建中,布局问题约束的分类及表达,计算机辅助设计与图形学学报,2000, 12(5): 349-354
[52]王金敏,马丰宁,初楠,查建中,基于构造的布局启发方法,天津大学学报,1998, 31(1): 17-22
[53]王金敏,陈东祥,马丰宁,查建中,布局问题的模拟退火算法,计算机辅助设计与图形学学报,1998, 10(3): 253-259
[54]王金敏,王玉新,曾维川,姚遥,喻宏波,基于遗传算法的布局求解法,天津大学学报,2001, 34(3): 307-311
[55]陆一平,查建中,李建勇,鄂明成,一种基于邻接极小搜索的布局模式生成方法,北方交通大学学报,2000, 24(4): 52-56
[56]李波,王秀峰,赵志彦,一种基于遗传算法的最优空间布置方法,系统仿真学报,2004,16(8):1845-1848
[57]Honda K., Mizoguchi F., Automatic Spatial Layout Planning System using a second-Generation Constraint Logic Programming Language, Expert systems with Applications, 1997, 13(4):291-297
[58]Kyungchul Park, Kyungsik Lee, Sungsoo Park and Sunghwan Kim, Modeling and solving the spatial block scheduling problem in a shipbuilding company, Computers ind. Engng 1996, 30(3):357-364
[59]Kyu-Kab Cho, Dongha lee and Tae H. Oum, An intelligent spatial planning and scheduling system, Proceedings of the 6th Annual International Conference on Industrial Engineering – Theory, Application, and Practice, San Francisco, CA, USA, November 18-20, 2001
[60]J. K. Lee, H. R. Choi, O. R. Yang and H. D. Kim, Scheduling shipbuilding using a constraint diverted search: DAS-ERECT, Intell. Sys. Account. Fin. Mngmnt 3,111-125(1994)
[61]Taho Yang, Brett A.Peters, Mingan Tu, Layout Design for Flexible Manufacturing Systems considering single-loop directional flow patterns, European Journal of Operational Research, 2005, 164:440-450
[62] Lee, K. J. and lee, J. K. (1996). A spatial scheduling system and its application to shipping: DAS-CURVE, Expert Systems with Applications, 10(3/4):311-324
[63] Cho, K. K., Chung, K. H., Park, C., Park, J. C. and Kim, H. S.(2001). A spatial scheduling system for block painting process in shipbuilding, Annals of the CIRP, 50(1):339-342
[64] Joo,M. H., Choi, H. R., Ryu, K. R., Hwang, J. H., and Cho, K. K. (1998), A curve block assembly schedule in shipbuilding using constraint relaxation method, Proceedings of the fall 98 conference of The KESS, Korean Expert System Society, pp.285-292
[65] Koh, S. G., Park J.C., Choi, Y.S., and Joo, C. M. (1999), Development of a block assembly scheduling system for shipbuilding company, IE Interfaces, 12(4):586-594
[66] Kyu-Kab Cho, Dongha lee and Tae H. Oum, An intelligent spatial planning and scheduling system, Proceedings of the 6th Annual International Conference on Industrial Engineering – Theory, Application, and Practice, San Francisco, CA, USA, November 18-20,2001.
[67] Kyoung Lee, Sufficient search space for spatial expert systems, Expert systems with applications, 2000, 19:1–8
[68]《人工智能原理》,2002 年 2 月第 1 版,武汉大学出版社,16-21
[69]D.E.Knuth,the Art of Computer Programming[M], Vol.1:Fundamental algorithms,3rd ed.北京:清华出版社,2002
[70]傅清祥,算法与数据结构(第二部),北京:电子工业出版社,2001.8,241-244
[71]S.Panwalker, W.Iskander, A survey of scheduling rules, Operations Research, 1997, 25(1):45-61
[2]造船过程——挑战和机遇,IBM 产品生命周期管理资源白皮书,2002,1:19-25
[3]S.M.Johnson, Optimal Two- and Three- Stage Production Scheduling with Set-up Times Included, Naval Research Logistics Quarterly, 1954, 1:61-68
[4] Story, A.E., Wagner, H. M., Computational Experience whit Integer Programming for Job-shop Scheduling, Industrial Scheduling, Chap.14, Prentice-Hall, 1963
[5] Gavett, J. W., Three Heuristic Rules for Sequencing Jobs to a Single Production Facility, Mgmt.Sci., 1965 ,11:166-176
[6] S.Panwalker, Wafilc Iskander., A Survey of Scheduling, Ops. Res., 1997, 25(1):45-61
[7] Stephen, C.Graves, A Review of Production Scheduling, Ops. Res., 1981, 29(4):646-675
[8] M. S. Fox., ISIS: A Retrospective. Intelligent Scheduling, Kaufmann, Michael B. Morgan, 1994:3-28
[9] F. A. Rodammer, K.P. White, Jr., A Recent Survey of Production scheduling, IEEE Transactions on Systems, Man, and Cybernetics, 1988, 18(6):841-851
[10] 王凌,车间调度及其遗传算法,清华大学出版社,2003
[11] 徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述,计算机研究与发展,2004,41(2):257-267
[12] Feng-Tse Lin, Constructing A Job-Shop Scheduling Model Based on Imprecise Data , The IEEE International Conference on Fuzzy Systems, 2003, 1374-1379
[13] 彭志刚,吴广宇,杨艳丽,徐心,一机两流的连铸生产计划模型与算法,东北大学学报,2000, 21(3): 244-246
[14] 余琦玮,基于遗传算法的作业车间调度问题研究:[硕士学位论文],浙江:浙江大学机械与能源工程学院,2004
[15] 陈东升,基于遗传算法的模糊车间作业调度问题的研究:[硕士学位论文],大连:大连理工大学机械电子工程系,2005
[16] 徐本强,车间调度的 Mas 智能决策技术研究与应用:[硕士学位论文],大连:大连海事大学计算机学院,2004
[17] 赵巍,基于多智能体的生产调度方法及其应用:[硕士学位论文],浙江:浙江工业大学,2004
[18] 朱红,用 DNA 算法求解车间调度问题的研究:[硕士学位论文],黑龙江:哈尔滨理工大学计算机与控制学院,2005
[19]耿兆强,邹益仁,基于遗传算法的作业车间模糊调度问题的研究,计算机集成制造系统-CIMS,2002.8(8): 616-620
[20]张旭,具有拓扑结构布局优化的理论及算法,[博士学位论文],大连,大连理工大学,2004.4
[21]Kenndy M P, Chua L O., Unifying the tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of chua and lin, IEEE Transactions on Circuits and Systems, 1987, CAS-34 (2): 210-214
[22]Kathryn A Dowsland, William B Dowsland, Packing Problems, Eur. J. of OR, 1992, 56 (1): 2- 14
[23] P.C.Gilinore, R.E_Gomory, A linear programming approach to the cutting stock problem, Operational Research, 1961, 9: 848-859
[24]P.C.Gilmore, R.E.Gomory, A linear programming approach to the cutting stock problem, Part2, Operational Research, 1963, 11: 863-888
[25]P.C.Gilmore, R.E.Gomory, Multistage cutting stock problem of two and more dimensions, Operational Research, 1965, 13: 94-120
[26]Garey M R, Johnson D S, Computers and Intractability: a Guide to the Theory of NP2 Completeness, SanFrancisco: Freeman, 1979
[27]Christophides N, Whitlock C, An algorithm for two-dimensional cutting stock problems, Operations Research, 1977, 25(1): 30-44
[28]Morabito R N, Arenales M N, Arcoro V F, Staged and constrained two-dimensional guillotine cutting problems: An AND/ OR-graph approach, European Journal of operational Research, 1996, 94: 548-560
[29]Hadjiconstantinou E, Christofides N., An exact algorithm for general, orthogonal, two-dimensional knapsack problems, European Journal of Operational Research, 1995, 83 (1): 39-56
[30] Bhattacharya S, Roy R, Bhattacharya S., An exact depth-first algorithm for the pallet-loading problem, European Journal of Operational Research, 1998,110 (3): 610-625
[31]Wang P Y., Two algorithms for constrained two-dimensional cutting stock problems, Operations Research, 1983, 31:573-386
[32]Beasley J E., An exact two-dimensional non-guillotine cutting tree search procedure, Operational Research, 1985, 33: 49-64
[33]Younis N A, Cavalier T M., On locating part bins in a constrained layout area for an automated assembly process, Computers&Industrial Engineering, 1990, 18 (2):111-118
[34]Murata H, Fujiyoshi K, Nakatake S, Kajitani Y, Rectangle-packing-based module placement, IEEE/ACM International Conference on Computer-Aided Design, Digest of Tactical Papers, IEEE, 1995: 472-479
[35] Hwang S, Kao C, Horng J, On solving rectangle bin packing problems using genetic algorithms, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1994: 1583-1590
[36] Jakobs S, On genetic algorithms for the packing of polygons, European Journal of Operational Research, 1996, 88 (1): 165-181
[37] Georgis N, Petrou M, Kittler J, On the constrained rectangle packing problem, International Journal of Modelling and Simulation, 2000,20(4): 293-299
[38]张春鸿,刘美伦,装箱问题在积木块布局中的应用,计算机学报,1987,5: 303-309
[39]徐雷,一类新的聚类分析算法:模拟退火算法,模式识别与人工智能,1989,2(1),11-16
[40]徐雷,模拟退火组合优化法在模式识别中的若干应用,自动化学报,1989, 15(2): 114-121
[41]许建国,二维松弛布局方法,计算机学报,1990, 3: 207-214
[42]曹炬,周济,冲裁件排样最优化的数学模型计算法,锻压技术,1993,6: 21-24
[43]曹炬,周济,冲裁件排样中对头双排的优化算法与实现,机械工业自动化,1994, 16(4): 24-26
[44]黄文奇,詹叔浩,求解 Packing 问题的拟物方法,应用数学学报,1979, 2(2): 176-180
[45]黄文奇,Packing 问题的拟物方法,应用数学学报,1986, 9(4): 443-453
[46]戴佐,查建中,袁俊良,一种基于八叉树表达的三维实体布局启发式算法,软件学报,1996,6(20): 629-636
[47]戴佐,查建中,袁俊良.三维实体布局中干涉检验的八叉树方法,计算机辅助设计和图形学,1995, 7(4): 257-262
[48]王金敏,查建中等.复杂物体间的距离,计算机辅助设计与图形学学报,1997, 9(1): 14-19
[49]戴佐,查建中,面向任意形状布局物体的启发式算法,计算机辅助设计与图形学学报,1995,7(10): 630-634
[50]王金敏,马丰宁,一种基于约束的布局求解方法,计算机辅助设计与图形学学报,1998, 10(2): 156-160
[51]王金敏,王玉新,查建中,布局问题约束的分类及表达,计算机辅助设计与图形学学报,2000, 12(5): 349-354
[52]王金敏,马丰宁,初楠,查建中,基于构造的布局启发方法,天津大学学报,1998, 31(1): 17-22
[53]王金敏,陈东祥,马丰宁,查建中,布局问题的模拟退火算法,计算机辅助设计与图形学学报,1998, 10(3): 253-259
[54]王金敏,王玉新,曾维川,姚遥,喻宏波,基于遗传算法的布局求解法,天津大学学报,2001, 34(3): 307-311
[55]陆一平,查建中,李建勇,鄂明成,一种基于邻接极小搜索的布局模式生成方法,北方交通大学学报,2000, 24(4): 52-56
[56]李波,王秀峰,赵志彦,一种基于遗传算法的最优空间布置方法,系统仿真学报,2004,16(8):1845-1848
[57]Honda K., Mizoguchi F., Automatic Spatial Layout Planning System using a second-Generation Constraint Logic Programming Language, Expert systems with Applications, 1997, 13(4):291-297
[58]Kyungchul Park, Kyungsik Lee, Sungsoo Park and Sunghwan Kim, Modeling and solving the spatial block scheduling problem in a shipbuilding company, Computers ind. Engng 1996, 30(3):357-364
[59]Kyu-Kab Cho, Dongha lee and Tae H. Oum, An intelligent spatial planning and scheduling system, Proceedings of the 6th Annual International Conference on Industrial Engineering – Theory, Application, and Practice, San Francisco, CA, USA, November 18-20, 2001
[60]J. K. Lee, H. R. Choi, O. R. Yang and H. D. Kim, Scheduling shipbuilding using a constraint diverted search: DAS-ERECT, Intell. Sys. Account. Fin. Mngmnt 3,111-125(1994)
[61]Taho Yang, Brett A.Peters, Mingan Tu, Layout Design for Flexible Manufacturing Systems considering single-loop directional flow patterns, European Journal of Operational Research, 2005, 164:440-450
[62] Lee, K. J. and lee, J. K. (1996). A spatial scheduling system and its application to shipping: DAS-CURVE, Expert Systems with Applications, 10(3/4):311-324
[63] Cho, K. K., Chung, K. H., Park, C., Park, J. C. and Kim, H. S.(2001). A spatial scheduling system for block painting process in shipbuilding, Annals of the CIRP, 50(1):339-342
[64] Joo,M. H., Choi, H. R., Ryu, K. R., Hwang, J. H., and Cho, K. K. (1998), A curve block assembly schedule in shipbuilding using constraint relaxation method, Proceedings of the fall 98 conference of The KESS, Korean Expert System Society, pp.285-292
[65] Koh, S. G., Park J.C., Choi, Y.S., and Joo, C. M. (1999), Development of a block assembly scheduling system for shipbuilding company, IE Interfaces, 12(4):586-594
[66] Kyu-Kab Cho, Dongha lee and Tae H. Oum, An intelligent spatial planning and scheduling system, Proceedings of the 6th Annual International Conference on Industrial Engineering – Theory, Application, and Practice, San Francisco, CA, USA, November 18-20,2001.
[67] Kyoung Lee, Sufficient search space for spatial expert systems, Expert systems with applications, 2000, 19:1–8
[68]《人工智能原理》,2002 年 2 月第 1 版,武汉大学出版社,16-21
[69]D.E.Knuth,the Art of Computer Programming[M], Vol.1:Fundamental algorithms,3rd ed.北京:清华出版社,2002
[70]傅清祥,算法与数据结构(第二部),北京:电子工业出版社,2001.8,241-244
[71]S.Panwalker, W.Iskander, A survey of scheduling rules, Operations Research, 1997, 25(1):45-61