离散制造企业批量生产车间调度智能优化研究
|
摘要
车间调度是集成制造系统的重要而薄弱的环节。论文针对离散制造企业批量生产车间调度的特点,以智能优化算法为主要技术手段,对批量生产的等量分批问题、平顺移动下等量分批多目标车间调度问题、多工艺流程下等量分批多目标车间调度问题、基于准时交货要求的批量生产柔性作业车间调度问题进行了深入研究,提出了系统化的优化方案。具体研究内容如下:
①对车间调度的分类、特点、发展、方法进行了系统的归纳与总结;对批量生产车间调度的研究现状进行了分析;指出现有研究存在的问题,明确了研究的目的。
②对离散制造企业批量生产车间调度问题进行了描述;针对批量生产车间调度特点,提出了一个包括目标层、准则层、影响因素层、变量层、方案层、技术层六层结构的批量生产车间调度智能优化技术框架;对技术框架中的基础理论及关键技术进行了深入研究。
③针对批量生产等量分批问题,提出了两种优化技术:基于Witness组合仿真优化的等量分批优化技术(WSC-ELS)和基于NSGA II算法的等量分批优化技术(NSGAII-ELS)。前者基于分步优化策略,是一种局部优化方法,计算速度快,可求解大规模等量分批调度问题;后者基于集成优化策略,是一种全局优化方法,计算速度相对慢,适用于求解中小规模等量分批调度问题。
④针对平顺移动下的等量分批多目标车间调度问题,提出了两种智能优化技术:平顺移动下等量分批JSP多目标优化技术(PO-MJSP)和平顺移动下等量分批FJSP多目标优化技术(PO-MFJSP)。解决方案的基本思路如下:根据问题特点建立多目标优化模型;提出并设计了改进的NSGA II算法对模型进行求解,在算法中采用了平顺移动、时间分离、相同作业、间隙挤压四种精细化调度技术缩短完工时间;通过案例分析得出了研究结论。
⑤针对多艺流程下等量分批多目标车间调度问题,提出了两种智能优化技术:多工艺流程下等量分批JSP多目标优化技术(MPF-MJSP)和多工艺流程下等量分批FJSP多目标优化技术(MPF-MFJSP)。解决方案的基本思路如下:以完工时间最短和生产成本最低建立了多目标优化模型;提出并设计了改进的NSGA II算法对模型进行求解,算法中引入了工艺流程编码,用于实现各加工批次的工艺流程优选;通过案例分析得出了研究结论。
⑥针对基于准时交货要求的批量生产柔性作业车间调度问题,提出了两种智能优化技术:基于准时交货要求的批量生产FJSP单目标优化技术(JIT-SFJSP)和基于准时交货要求的批量生产FJSP多目标优化技术(JIT-MFJSP)。对于前者,建立了以加权平均隶属度最大为目标函数的单目标优化模型,提出并设计了一种多阶段混合变异的改进禁忌搜索算法;对于后者,建立了以加权平均隶属度最大和流程时间价值总量最小为目标函数的多目标优化模型,提出并设计了一种改进的NSGA II算法,算法中引入了各加工批次最早允许开工时刻以消解准时交货要求和快速生产之间的矛盾;通过案例分析得出了研究结论。
⑦最后,对本文研究工作进行了总结,并对批量生产调度问题的进一步研究工作进行了展望。
Job-shop scheduling is the very important, but weak part in the integrated manufacturing system. In view of the Job-shop scheduling characteristics for batch production of discrete enterprises, intelligent optimization algorithms taken as the main technical measure, the following four issues about Job-shop scheduling for batch production are deeply studied and its optimization solutions are proposed: equal lot splitting problem, multi-objective optimization problem for equal batch splitting Job-shop scheduling under parallel and ordinal shift mode, multi-objective optimization problem for equal batch splitting Job-shop scheduling under multiple process flows, multi-objective optimization problem for batch production FJSP based on JIT delivery. The main contributions of this thesis are shown as follows:
①The classification, characteristic, development and method of Job-shop scheduling is systematically induced and summarized. The research status for Job-shop scheduling of batch production is analyzed. The existing problems and the research object are presented.
②Description is given to Job-shop scheduling problem for batch production of discrete enterprises. Considering the characteristics of Job-shop scheduling for batch production, a six-hierarchy technical framework is proposed, including object hierarchy, rule hierarchy, influence factor hierarchy, variable hierarchy, scheme hierarchy and technique hierarchy. The basic theories and critical techniques in the framework are thoroughly studied.
③For the equal lot splitting problem of batch production, two optimization techniques are proposed: one is the equal lot splitting technique based on Witness combinational simulation optimization technique (WSC-ELS), the other is that based on NSGA II(NSGAII-ELS). The former is based on decomposition optimization strategy, belonging to a local optimization method, calculating quickly, fit for large-scale equal lot splitting Job-shop scheduling problem. The latter is based on integrated optimization strategy, belonging to a global optimization method, calculating relatively slowly, fit for modest-scale equal lot splitting Job-shop scheduling problem.
④For the multi-objective optimization problem of the equal batch splitting Job-shop scheduling under parallel and ordinal shift mode, two intelligent optimization techniques are put forward: one is the multi-objective optimization technique of equal lot JSP under parallel and ordinal shift mode (PO-MJSP) , the other is that of equal lot FJSP parallel and ordinal shift mode (PO-MFJSP). The basic solution thought is demonstrated as follows: Firstly, a multi-objective optimization model is established; Secondly, an improved NSGA II is presented and designed to solve the model, in which four delicacy scheduling techniques are used to reduce the makespan, including parallel and ordinal shift, time separation, similar operation and interval squeezing; Thirdly, conclusion is drawn by case study.
⑤For the multi-objective optimization problem of the equal batch splitting Job-shop scheduling under multiple process flows, two intelligent optimization techniques are presented: one is the multi-objective optimization technique of equal lot JSP under multiple process flows (MPF-MJSP), the other is that of equal lot FJSP under multiple process flows (MPF-MFJSP). The basic solution thought is shown as follows: Firstly, a multi-objective optimization model is established with the objective to minimize the makespan and the manufacturing cost; Secondly, an improved NSGA II is proposed and designed to solve the model, in which process flow code is introduced to implement the optimal selection of process flow for every process batch; Thirdly, conclusion is drawn by case study.
⑥For the multi-objective optimization problem of batch production Flexible Job-shop scheduling based on JIT delivery, two intelligent optimization techniques are proposed: one is the single-objective optimization technique of batch production FJSP under JIT delivery (JIT-SFJSP), the other is multi-objective optimization technique of batch production FJSP under JIT delivery (JIT-MFJSP) . For the former issue, an optimization model is established with the objective to maximize the weighted average membership degree, and an improved multi-stage hybrid mutation taboo search algorithm is put forward and designed to solve the model. For the latter issue, a multi-objective optimization model is constructed with the objective to maximize the weighted average membership degree and minimize the total flow time value , and an improved NSGA II is presented and designed to solve the model, in which the earliest allowable begin time of every process batch is introduced to eliminate the contradiction between the JIT delivery demand and quick production.
⑦Finally, the whole research work of the dissertation is summarized, and the future work of batch production scheduling is given.
①对车间调度的分类、特点、发展、方法进行了系统的归纳与总结;对批量生产车间调度的研究现状进行了分析;指出现有研究存在的问题,明确了研究的目的。
②对离散制造企业批量生产车间调度问题进行了描述;针对批量生产车间调度特点,提出了一个包括目标层、准则层、影响因素层、变量层、方案层、技术层六层结构的批量生产车间调度智能优化技术框架;对技术框架中的基础理论及关键技术进行了深入研究。
③针对批量生产等量分批问题,提出了两种优化技术:基于Witness组合仿真优化的等量分批优化技术(WSC-ELS)和基于NSGA II算法的等量分批优化技术(NSGAII-ELS)。前者基于分步优化策略,是一种局部优化方法,计算速度快,可求解大规模等量分批调度问题;后者基于集成优化策略,是一种全局优化方法,计算速度相对慢,适用于求解中小规模等量分批调度问题。
④针对平顺移动下的等量分批多目标车间调度问题,提出了两种智能优化技术:平顺移动下等量分批JSP多目标优化技术(PO-MJSP)和平顺移动下等量分批FJSP多目标优化技术(PO-MFJSP)。解决方案的基本思路如下:根据问题特点建立多目标优化模型;提出并设计了改进的NSGA II算法对模型进行求解,在算法中采用了平顺移动、时间分离、相同作业、间隙挤压四种精细化调度技术缩短完工时间;通过案例分析得出了研究结论。
⑤针对多艺流程下等量分批多目标车间调度问题,提出了两种智能优化技术:多工艺流程下等量分批JSP多目标优化技术(MPF-MJSP)和多工艺流程下等量分批FJSP多目标优化技术(MPF-MFJSP)。解决方案的基本思路如下:以完工时间最短和生产成本最低建立了多目标优化模型;提出并设计了改进的NSGA II算法对模型进行求解,算法中引入了工艺流程编码,用于实现各加工批次的工艺流程优选;通过案例分析得出了研究结论。
⑥针对基于准时交货要求的批量生产柔性作业车间调度问题,提出了两种智能优化技术:基于准时交货要求的批量生产FJSP单目标优化技术(JIT-SFJSP)和基于准时交货要求的批量生产FJSP多目标优化技术(JIT-MFJSP)。对于前者,建立了以加权平均隶属度最大为目标函数的单目标优化模型,提出并设计了一种多阶段混合变异的改进禁忌搜索算法;对于后者,建立了以加权平均隶属度最大和流程时间价值总量最小为目标函数的多目标优化模型,提出并设计了一种改进的NSGA II算法,算法中引入了各加工批次最早允许开工时刻以消解准时交货要求和快速生产之间的矛盾;通过案例分析得出了研究结论。
⑦最后,对本文研究工作进行了总结,并对批量生产调度问题的进一步研究工作进行了展望。
Job-shop scheduling is the very important, but weak part in the integrated manufacturing system. In view of the Job-shop scheduling characteristics for batch production of discrete enterprises, intelligent optimization algorithms taken as the main technical measure, the following four issues about Job-shop scheduling for batch production are deeply studied and its optimization solutions are proposed: equal lot splitting problem, multi-objective optimization problem for equal batch splitting Job-shop scheduling under parallel and ordinal shift mode, multi-objective optimization problem for equal batch splitting Job-shop scheduling under multiple process flows, multi-objective optimization problem for batch production FJSP based on JIT delivery. The main contributions of this thesis are shown as follows:
①The classification, characteristic, development and method of Job-shop scheduling is systematically induced and summarized. The research status for Job-shop scheduling of batch production is analyzed. The existing problems and the research object are presented.
②Description is given to Job-shop scheduling problem for batch production of discrete enterprises. Considering the characteristics of Job-shop scheduling for batch production, a six-hierarchy technical framework is proposed, including object hierarchy, rule hierarchy, influence factor hierarchy, variable hierarchy, scheme hierarchy and technique hierarchy. The basic theories and critical techniques in the framework are thoroughly studied.
③For the equal lot splitting problem of batch production, two optimization techniques are proposed: one is the equal lot splitting technique based on Witness combinational simulation optimization technique (WSC-ELS), the other is that based on NSGA II(NSGAII-ELS). The former is based on decomposition optimization strategy, belonging to a local optimization method, calculating quickly, fit for large-scale equal lot splitting Job-shop scheduling problem. The latter is based on integrated optimization strategy, belonging to a global optimization method, calculating relatively slowly, fit for modest-scale equal lot splitting Job-shop scheduling problem.
④For the multi-objective optimization problem of the equal batch splitting Job-shop scheduling under parallel and ordinal shift mode, two intelligent optimization techniques are put forward: one is the multi-objective optimization technique of equal lot JSP under parallel and ordinal shift mode (PO-MJSP) , the other is that of equal lot FJSP parallel and ordinal shift mode (PO-MFJSP). The basic solution thought is demonstrated as follows: Firstly, a multi-objective optimization model is established; Secondly, an improved NSGA II is presented and designed to solve the model, in which four delicacy scheduling techniques are used to reduce the makespan, including parallel and ordinal shift, time separation, similar operation and interval squeezing; Thirdly, conclusion is drawn by case study.
⑤For the multi-objective optimization problem of the equal batch splitting Job-shop scheduling under multiple process flows, two intelligent optimization techniques are presented: one is the multi-objective optimization technique of equal lot JSP under multiple process flows (MPF-MJSP), the other is that of equal lot FJSP under multiple process flows (MPF-MFJSP). The basic solution thought is shown as follows: Firstly, a multi-objective optimization model is established with the objective to minimize the makespan and the manufacturing cost; Secondly, an improved NSGA II is proposed and designed to solve the model, in which process flow code is introduced to implement the optimal selection of process flow for every process batch; Thirdly, conclusion is drawn by case study.
⑥For the multi-objective optimization problem of batch production Flexible Job-shop scheduling based on JIT delivery, two intelligent optimization techniques are proposed: one is the single-objective optimization technique of batch production FJSP under JIT delivery (JIT-SFJSP), the other is multi-objective optimization technique of batch production FJSP under JIT delivery (JIT-MFJSP) . For the former issue, an optimization model is established with the objective to maximize the weighted average membership degree, and an improved multi-stage hybrid mutation taboo search algorithm is put forward and designed to solve the model. For the latter issue, a multi-objective optimization model is constructed with the objective to maximize the weighted average membership degree and minimize the total flow time value , and an improved NSGA II is presented and designed to solve the model, in which the earliest allowable begin time of every process batch is introduced to eliminate the contradiction between the JIT delivery demand and quick production.
⑦Finally, the whole research work of the dissertation is summarized, and the future work of batch production scheduling is given.
引文
[1]王勇,马承翰,马光锋.先进制造系统运行控制理论中调度问题综述[J].煤矿机械, 2002, 6: 1-2.
[2]李光华,陈昌领,邵惠鹤.批处理过程优化调度研究综述_1_MILP调度方法的描述框架[J].化工自动化及仪表, 2002, 29(5) : 1-6.
[3]肖力墉,苏宏业,苗宇,等.制造执行系统功能体系结构[J].化工学报, 2010, 61(2): 359-364.
[4]周延佑,陈长年.多品种、单件、小批量生产和少品种、大批量生产解决方案的新发展[J].制造技术与机床, 2007, 5: 28-36.
[5]袁坤.智能制造系统车间生产计划与调度[D].南京:南京航空航天大学, 2007.
[6]鞠全勇.智能制造系统生产计划与车间调度的研究[D].南京:南京航空航天大学, 2007.
[7]钟雪灵.基于动态规划的分批排序算法[J].计算机工程与应用, 2010, 46(7): 229-231.
[8]张玉忠,王忠志,王长钰.分批排序的_转换引理_及其应用[J].系统科学与数学, 2002, 22(3): 328-333.
[9]牛海军,孙树栋. JIT方式下的单机分批调度问题研究[J].西安电子科技大学学报, 2002, 29(4): 444-460.
[10]张建伟,张保威,郭云飞.一类分批排序问题的复杂性分析及近似算法[J].计算机工程与应用, 2007, 43(3): 175-178.
[11]张召生,孔淑兰,马建华.求解多目标单机分批排序问题[J].山东大学学报, 2004, 39(2): 50-55.
[12]李曙光,李国君,王秀红.极小化加权完工时间和的无界批量机器并行调度问题[J].软件学报, 2006, 17(10): 2063-2068.
[13]徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述[J].计算机研究与发展, 2004, 41(2): 260-267.
[14]韩兵,席裕庚.多机器总完成时间和makespan近似最优的开放式车间调度方法[J].控制理论与应用, 2003, 20(6): 859-864.
[15]孙志峻,潘全科,朱剑英.基于遗传算法的多资源作业车间智能优化调度[J].中国机械工程, 2002, 13(24): 2104-2107.
[16]吴秀丽.多目标柔性作业车间调度技术研究[D].西安:西北工业大学, 2006.
[17]张朝勇.基于自然启发式算法的作业车间调度问题理论与应用研究[D].武汉:华中科技大学, 2006.
[18]金锋,吴澄.大规模生产调度问题的研究现状与展望[J].计算机集成制造系统, 2006,12(2): 161-169.
[19] Cook S A. The complexity of theorem proving procedures[C]. The proceedings of the Third Annual ACM Symposium on the Theory of Computing, Association of Computing Machinery, New York, 1971, 151-158.
[20] Lawler E L, Lenstra J K, Rinnooy Kan A H G. Recent developments in deterministic sequence and scheduling: a survey. In: dempster M A H et al. (Eds), Determinstic and Stochastic Scheduling. Reidel, Dordrecht, 1982, 35-73.
[21] Blazewicz J, Ecker K H, Schmidt G, et al. Scheduling in Computer and Manufacturing Systems[M]. Second Revised Edtition. Berlin: Springer-Verlag, 1996.
[22] Garey M R, Johnson D S. Computers and intractability: a guide to the theory of NP-comleteness[J]. San Francisco: Freeman, 1979.
[23]王万良.生产调度智能算法及其应用[M].北京:科学出版社, 2007.
[24]王书锋,邹益仁.车间作业调度_JSSP_技术问题简明综述[J].系统工程理论与实践, 2003, 1: 49-55.
[25] Ashour S, Hiremath S R. Branch-and-bound approach to the Job-shop scheduling problem[J]. International Journal of Production Research, 1973, 11(1): 47-58.
[26] Chen M. A mathematical programming model for system reconfiguration in a dynamic cellular manufacturing environment[J]. Annals of Operation Research, 1998, 77: 109-128.
[27] Gupta J, Darrow W P. The two-machine sequence dependent flow shop problem[J]. European Journal of Operational Research, 1986, 24(3):439-446.
[28] Fernandes S, Lourenco H R. A GRASP and branch-and-bound metaheuristic for the job-shop scheduling[C]. Lecture Notes in Computer Science, 2007, 4446(LNCS): 60-71, 2007- Proceedings of the 7th European Conference, EvoCOP 2007.
[29] Luh P B, ZhaoX, Wang Y J, et al. Lagrangian relaxation neural networks for job shop scheduling[J]. IEEE Transactions on Robotics and Automation, 2000, 16(1): 78-88.
[30] Jackson J R. Scheduling a production line to minimize maximum tardiness[J]. Research Report 43, Management Science Research Projects, University of California, Los Angeles, USA, 1955.
[31] Smith W E. Various optimizers for single stage production[J]. Naval Research Logistics Quarterly, 1956, 3: 59-66.
[32] Panwalkar S. A survey of scheduling rules[J]. Operation Research, 1977, 25(1): 45-61.
[33] Kuriyan K, et al. Scheduling network flowshops so as to minimize makespan[J]. Computers and chemical Engineering, 1989, 113(1-2): 187-200.
[34] Montazeri M, Van W L N. Analysis of scheduling rules for an FMS. International Journal ofProduction Research[J], 1990, 28: 785-802.
[35]高红,熊光椤.决策规则在仿真调度中的应用[J].控制与决策, 1995, 10(2): 114-118.
[36] Kanet J J, et al. Expert system in production scheduling[J]. European Journal of Operational Research, 1987, 29:51-59.
[37] Kim M, Lee I B. On-line rescheduling system for multi-purpose processes[J]. China-Korea Joint Work-shop on Process Systems Engineering. Hangzhou, China, 1997: 84-89.
[38]安政,苏春.基于规则和仿真的多机并行作业车间生产调度研究[J].工业工程, 2010, 13(1): 64-68.
[39]陈晓慧,张启忠.可重入式生产车间调度的计算机仿真与优化研究[J].计算机科学, 2009, 36(9): 297-302.
[40] Zhou D N, Cherkassky V, Baldwin T R, et al. Scaling neural network for job-shop scheduling[C]. Proceedings of the International Joint Conference on Neural Networks, 1990, 889-894.
[41] Foo S Y, Takefuji Y, Szu H. Job-shop scheduling based on modified Tank-Hopfield linear programming networks[J]. Engineering Applications of Artificial Intelligence, 1994,7(3): 321-327.
[42] Jain A S, Meeran S. Job-shop scheduling using neural networks[J]. International Journal of Production Research, 1998, 36(5): 1249-1272.
[43] Ibrahim S, El-Baz M A, Esh E. Neural networks for job shop scheduling problems[J] .Journal of Engineering and Applied Science, 2009, 56(2):169-183.
[44]奚立峰,周炳海,蔡建国,等.基于规则的人工神经网络FMS动态调度[J].机床与液压, 2002, 4: 32-55.
[45]张传芹,盛昭瀚.连续过程生产调度预警及专家系统的应用研究[J].信息与控制, 2002, 31(4): 300-314.
[46]王万良,吴启迪,徐新黎.基于Hopfield神经网络的作业车间生产调度方法[J].自动化学报, 2002, 28(5): 838-844.
[47]郭沛俊,袁一.化工过程集成智能生产调度系统开发[J].化工自动化及仪表, 1994, 21(5): 8-11.
[48] Fox M S, Allen B P, Smith S F, et al. ISIS: A Constraint-Directed Reasoning Approach to Job Shop Scheduling[R]. CMU-RI-TR-83-8, 1983: 25.
[49] Fox M S, Smith S F. Constraint-Based Scheduling in an Intelligent Logistics Support System: An Artificial Intelligence Approach. Sponsor: Air Force Office of Scientific Research, Bolling AFB, DC., 1986: 56.
[50] Potvin J Y, Smith S F. Flexible systems for the design of heuristic algorithms in complex ordomains, 1989.
[51] Collinot A, Le P C. Controlling the behavior of knowledge sources within SONIA[C]. Proceedings of the Hawaii International Conference on System Science, 1989, 3: 221-228.
[52] Anne C, Claude L P. Adapting the behavior of a job-shop scheduling system[J]. Decision Support Systems, 1991, 7(4): 341-353.
[53] Daniel F, Jens N, Heinz W, et al. Benchmarking and robust multi-agent-based production planning and control[J]. Engineering Applications of Artificial Intelligence, 2003, 16(4): 307-320.
[54]李飒,王云莉,段广洪,等.基于多智能体结构的车间调度方法[J].机械科学与技术, 2000, 19(6): 956-958.
[55]张宇,孙宪鹏,尹朝万,等.一种基于Agent的Job Shop调度模型[J].中国机械工程, 2001, 12(10): 1138-1141.
[56]徐新黎,应时彦,王万良.求解模糊柔性Job-shop调度问题的多智能体免疫算法[J].控制与决策, 2010, 25(2): 171-184.
[57] Wong T N, Leung C W, Mak K L, et al. Integrated process planning and scheduling/rescheduling - An agent-based approach[J]. International Journal of Production Research, 2006, 44(18-19): 3627-3655.
[58] Glover F. Future paths for integer programming and links to artificial intelligence[J]. Computers and Operations Research, 1986, 13: 533-549.
[59] Hansen P. The steeperest ascent mildest descent heuristic for combinatorial programming. In: Congress on Numerical Methods in Combinatiorial Optimization, Capri, Ttaly, 1986.
[60]童刚,李光泉,刘宝坤.一种用于Job-Shop调度问题的改进禁忌搜索算法[J].系统工程理论与实践, 2001, 9: 48-52.
[61]潘全科,朱剑英.一类解决Job Shop问题的禁忌搜索算法[J].中国机械工程, 2006, 17(5): 536-539.
[62]宋晓宇,朱云龙,尹朝万,等.求解模糊Job Shop调度问题的改进禁忌搜索算法[J].沈阳建筑大学学报(自然科学版), 2006, 22(5): 841-845.
[63]张超勇,高亮,李新宇,等.基于进化禁忌算法的Job-Shop调度问题研究[J].华中科技大学学报(自然科学版), 2009, 37(8): 80-95.
[64]宋晓宇,曹阳,孟秋宏.求解Job Shop调度问题的粒子群算法研究[J].系统工程与电子技术, 2008, 30(12): 2398-2401.
[65]姜思杰,张付亮,王孔茂.基于遗传和禁忌算法求解一类车间调度问题[J].计算机集成制造系统, 2003, 9(11): 984-988.
[66]梁旭,黄明.禁忌-并行遗传算法在作业车间调度中的应用[J].计算机集成制造系统,2005, 11(5): 678-681.
[67]梁迪,谢里阳,隋天中,等.基于遗传和禁忌搜索算法求解双资源车间调度问题[J].东北大学学报(自然科学版), 2006, 27(8): 895-898.
[68] Metropolis N, Rosenbluth A W, Rosenbluth M N, et al. Equation of state calculations by fast computing machines[J]. The Journal of Chemical Physics, 1953, 21(6): 1087-1092.
[69] Grefenstette J J. Optimization of control parameters for genetic algorithms[J]. IEEE Transactions on System, Man and Cybernetics, 1988, 16(1): 122-128.
[70]张瑞,吴澄.求解Job Shop问题的一种免疫模拟退火算法[J].中国机械工程, 2008, 19(23): 2824-2829.
[71]刘晓霞,谢里阳,陶泽,等.基于生产费用的柔性作业车间调度优化[J].东北大学学报(自然科学版), 2008, 29(4): 261-564.
[72]夏蔚军,吴智铭.基于混合微粒群优化的多目标柔性Job-shop调度[J].控制与决策, 2005, 20(2): 137-141.
[73]王万良,吴启迪.基于Hopfield神经网络求解作业车间调度问题的新方法[J].计算机集成制造系统, 2001, 7(12): 7-12.
[74] J H Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence[M]. Cambridge, MA: MIT Press, 1992.
[75]雷英杰,张善文,李续武,等. Matlab遗传算法工具箱及应用[M].西安:西安电子科技大学出版社, 2005.
[76] Kim J H, Myung H. A two-phase evolutionary programming for general constrained optimization problem[C]. In Proc. of the Fifth Conference on Evolutionary Programming, San Diego, 1996.
[77] Michalewicz Z. Genetic algorithms, numberical optimization, and constraints[C]. In Eshelman: 151-158.
[78] Orvosh D, Davis L. Using a genetic algorithm to optimize problems with feasibility constraints[C]. IEEE Conference on Evolutionary Computation, 1994, 2: 548-553.
[79] Myung H, Kim J H. Hybrid evolutionary programming for heavily constrained problems[J]. Bio-Sysetms, 1996, 38: 29-43.
[80] Coello C A C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art[J]. Comput Methods Appl Mech Engry, 2002, 191: 1245-1287.
[81]玄光男,程润伟.遗传算法与工程设计[M].北京:科学出版社. 2000.
[82]周辉仁,郑丕谔,安小会,等.基于遗传算法求解Job Shop调度优化的新方法[J].系统仿真学报, 2009, 21(11): 3295-3306.
[83]席卫东,乔兵,朱剑英.基于改进遗传算法的柔性作业车间调度[J].哈尔滨工业大学学报, 2007, 39(7): 1151-1153.
[84]张国辉,高亮,李培根,等.改进遗传算法求解柔性作业车间调度问题[J].机械工程学报, 2009, 45(7): 146-151.
[85]赵良辉,邓飞其.一种求解作业车间调度问题的混和遗传算法[J].系统工程与电子技术, 2007, 29(6): 899-902.
[86]齐德新,刘永贤,张树良.单染色体遗传算法在制造系统作业调度中的应用[J].辽宁工程技术大学学报, 2006, 25(6): 911-913.
[87]张维存,郑丕谔,吴晓丹.基于主-从遗传算法求解柔性调度问题[J].计算机集成制造系统, 2006, 12(8): 1241-1245.
[88]庄新村,卢宇灏,李从心.基于遗传算法的车间调度问题[J].计算机工程, 2006, 32(1): 193-197.
[89]蔡良伟,张基宏,李霞.作业车间调度问题的多种群遗传算法[J].电子学报, 2005, 33(6): 991-994.
[90]蔡良伟,李霞. Job Shop调度问题的遗传退火算法[J].系统工程与电子技术, 2004, 26(11): 1698-1700.
[91]马佳,石刚,高立群,等.求解FJSP的自适应免疫遗传算法[J].系统仿真学报, 2009, 21(12): 3609-3613.
[92]赵韩,高先圣,姜康,等.基于免疫遗传算法的多目标柔性作业车间调度研究[J].系统仿真学报, 2008, 20(22): 6163-6168.
[93]司书宾,孙树栋,徐娅萍.求解Job-Shop调度问题的多种群双倍体免疫算法研究[J].西北工业大学学报, 2007, 25(1): 27-31.
[94]刘胜辉,张淑丽,王波,等.单件车间调度问题的改进型病毒进化遗传算法[J],电机与控制学报, 2008, 12(2): 234-238.
[95] Dorigo M, Maniezzo V, Colorni A. Ant System: Optimization by a colony of cooperation agents[J]. IEEE Transactions on SMC, 1996, 26(1): 8-41.
[96]张纪会.自适应蚁群算法[J].控制理论与应用, 2000, 17(1): 1-8.
[97]陈美军,张志胜,史金飞.基于自适应蚁群算法的多约束车辆路径问题[J].东南大学学报, 2008, 38(1): 37-42.
[98]彭沛夫,林亚军,胡斌,等.基于遗传因子的自适应蚁群算法最优PID控制[J].电子学报, 2006, 34(6): 1109-1113.
[99] Favuzza S, Graditi G, Sanseverino E, et al. Adaptive and dynamic ant colony search algorithm for optimal distribution systems reinforcement strategy[J]. Applied Intelligence,2006, 24(1): 31-42.
[100]张杰慧,何中市,王健,等.基于自适应蚁群算法的组合式特征选择算法[J].系统仿真学报, 2009, 21(6): 1605-1614.
[101] Shan M Y, Li G. Auto-adapted ant colony optimization algorithm for wavelet network and its applications[C]. 2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006 (142440-4665), 2006: 2437-2442.
[102]傅鹏,张德运,马兆丰,等.网络中基于模拟退火_蚁群算法的QoS路由发现方法[J].西安交通大学学报, 2006, 40(2):179-190.
[103] Musa R, Chen F F Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem[J]. International Journal of Advanced Manufacturing Technology, 2008, 37(7-8): 837-850.
[104]毛宁,顾军华,谭庆,等.蚁群遗传混合算法[J].计算机应用, 2006, 26(7): 1692-1696.
[105] Keramati A, Azadeh A, Ebrahimipour V, et al. Application of a hybrid genetic-ant colony algorithm for exploring the relationship between IT and performance of organizations[J]. IIE Annual Conference and Expo 2008:1107-1112.
[106]张维存,郑丕谔,吴晓丹.基于蚁群粒子群算法求解多目标柔性调度问题[J].计算机应用, 2007, 27(4): 936-941.
[107] Shelokar P S, Siarry P, Jayaraman V K, et al. Particle swarm and ant colony algorithms hybridized for improved continuous optimization[J]. Applied Mathematics and Computation (0096-3003), 2007, 188(1): 129-142.
[108]王万良,赵澄,熊婧,等.基于改进蚁群算法的柔性作业车间调度问题的求解方法[J].系统仿真学报, 2008, 20(16): 4326-4329.
[109]张晴,陈知美,顾幸生.具有滚动优化特性的改进型蚁群算法及其在提前/拖期Job Shop问题中的应用[J].华东理工大学学报(自然科学版), 2008, 34(1): 112-116.
[110]宋晓宇,朱云龙,尹朝万,等.应用混合蚁群算法求解模糊作业车间调度问题[J].计算机集成制造系统, 2007, 13(1): 105-119.
[111]宋晓宇,王丹.求解Job Shop调度问题的混合蚁群算法研究[J].计算机工程, 2007, 33(4): 218-219.
[112]陈知美,顾幸生.改进型蚁群算法在Job Shop问题中的应用[J]. 2006, 332(4): 466-450.
[113] Kennedy J, Eberhart R C. Particle swarm optimisation[C]. IEEE International Conference on Neural Networks, 1995: 1942-1948.
[114]谷峰,陈华平,卢冰原,等.粒子群算法在柔性工作车间调度中的应用[J].系统工程, 2005, 23(9): 20-23.
[115]潘全科,王文宏,朱剑英.基于粒子群优化和模拟退火的混合调度算法[J].中国机械工程, 2006, 17(10): 1044-1064.
[116]潘全科,王文宏,潘群,等.解决JOB SHOP问题的粒子群优化算法[J].机械科学与技术, 2006, 25(6): 675-679.
[117]柳毅,叶春明,沈运红.应用改进微粒群算法求解Job-shop调度问题[J].系统工程与电子技术, 2006, 28(4): 602-606.
[118] Gomez A, Cuevas R, De L F D, et al. New metaheuristic for the Job Shop Scheduling Problem with PSO[C]. Proceedings of the 2008 International Conference on Artificial Intelligence, ICAI 2008 and Proceedings of the 2008 International Conference on Machine Learning, Models, Technologies and Applications, 2008: 552-553.
[119] Sha D Y,Lin H H. A multi-objective PSO for job-shop scheduling problems. Expert Systems with Applications, 2010, 37(2): 1065-1070.
[120] Girish B S, Jawahar N. A particle swarm optimization algorithm for flexible job shop scheduling problem[C]. IEEE International Conference on Automation Science and Engineering, CASE 2009, 2009: 298-303.
[121]鞠全勇,朱剑英.多目标批量生产柔性作业车间优化调度[J].机械工程学报, 2007, 43(8): 148-154.
[122]邓慈云,陈焕文,刘泽文,等.一种求解Job-Shop调度问题的混合自适应变异粒子群算法[J].计算机工程与科学, 2010, 32(1): 47-50.
[123]李俊青,潘全科,王玉亭,等.求解Job shop的一种快速混合算法[J].微电子学与计算机, 2010, 27(1): 113-119.
[124] Sh D J, He J, Wang L. Job shop scheduling problem with a novel particle swarm optimization based on tabu search[C]. 2009 International Conference on Artificial Intelligence and Computational Intelligence, AICI 2009, 2009: 97-100.
[125] LinTsung L, Horng S J, Kao T W, et al. An efficient job-shop scheduling algorithm based on particle swarm optimization[J]. Expert Systems with Applications, 2010, 37(3): 2629-2636.
[126]冯根尧,颜蕾.生产与运作管理[M].重庆大学出版社, 2003.
[127] Karmarkar U S, Kekre S. Lot-sizing in multi-item multi-machine job shops[J]. IIE Transactions, 1985, 17: 290-298.
[128]潘全科,朱剑英.多工艺路线的批量生产调度优化[J].机械工程学报, 2004, 40(4): 36-39.
[129]熊红云,何钺.面向柔性生产线的分批与调度集成模型及其遗传启发算法[J].长沙铁道学院学报, 2001, 19(1): 51-55.
[130] Jeong H L, Park J, Leachman R C. A Batch splitting method for a job shop scheduling problem in an MRP environment[J]. International Journal of Production Research, 1999, 37(15): 3583-3598.
[131]白俊杰,龚毅光,王宁生,等.多目标柔性作业车间分批优化调度[J],计算机集成制造系统, 2010, 16(2): 396-403.
[132]李崇斌,何桢.平行顺序移动的同顺序排序法研究[J].成组技术与生产现代化, 1990, 3.
[133]周焯华,晏平,杨波.一般作业车间零件提前/拖期的数学模型研究[J].重庆建筑大学学报, 1999, 21(3): 110-113.
[134]周亚勤,李蓓智,杨建国.考虑批量和辅助时间等生产工况的智能调度方法[J].机械工程学报, 2006, 42(1): 52-56.
[135]周泓,张惠民.求解含调整时间排序问题的混合遗传算法[J].航空学报, 2001, 22(2): 180-183.
[136] Kim S, Bobrowski P. Impact of Sequence-dependent Setup Time on Jobshop Scheduling Performance[J]. International Journal of Production Research, 1992, 32: 1503-1520.
[137] Zhou C, Egbelu P J. Scheduling in a Manufacturing Shop with Sequence-dependent Setups[J]. Robotics and Computer Integrated Manufacturing, 1989, 5: 73-81.
[138] Aanen E, Gaalman C, Nawijn W. A Scheduling Approach for a Flexible Manufacturing System[J]. International Journal of Production Research, 1993, 31: 2369-2385.
[139] Choi I C, Korkmaz O. Job Shop Scheduling with Separable Sequence Dependent Setups[J]. Annals of Operations Research, 1997, 70: 155-170.
[140]周泓;张惠民.求解多目标作业排序问题的遗传算法[J].系统工程理论与实践, 2001, 8: 1-8.
[141]张书珩.核心竞争力[M]:北京:金城出版社, 2005: 1-2.
[142]郑金华,蒋浩,邝达,等.用擂台赛法则构造多目标Pareto最优解集的方法[J].软件学报, 2007, 18(6): 1287-1297.
[143]林锉云,董加礼.多目标优化的方法与理论[M].吉林:吉林教育出版社, 1992.
[144]甘应爱,田丰,等.运筹学[M].北京:清华大学出版社, 1999: 448-461.
[145]吴秀丽,孙树栋,余建军,等.多目标柔性作业车间调度优化研究[J].计算机集成制造系统, 2006, 12(5): 731-736.
[146]宋立锋,韦岗,王群生.以多目标优化的轮廓定位分割视频对象[J].电子与信息学报, 2002, 24(11): 1551-1558.
[147]贺国先.多目标规划在铁路零担货运中转装车问题中的应用[J].中国铁道科学, 2007, 28(4): 111-116.
[148]张土乔,许刚,吕谋,等.用于供水系统直接优化调度的蚁群改进算法[J].计算机集成制造系统, 2006, 12(6): 918-923.
[149]万世明.矿井设计多目标优化法探讨[J].煤炭工程, 1991,1: 6-8.
[150]周根贵.求解多目标最优化问题的功效系数法[J].上海理工大学学报, 1987, 9(3):103-108.
[151] Fonseca C M, Fleming P J. An overview of evolutionary algorithms in multi-objective optimization[J]. Evolutionary Computation, 1995, 3(1): 1-16.
[152] Schaffer J D. Multiple objective optimization with vector evaluated genetic algorithms[C]. Proceeding of the First International Conference on Genetic Algorithms. New Jersey, Britain: IEE, 1985.
[153] Cheol G L, Dong H C, Hyum K J, et al. Niching genetic Algorithm with restricted competition selection for multimodal function optimization[J]. IEEE Transactions on Maqnetics, 1999, 35(3): 1722-1725.
[154] Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach[J]. IEEE Trans.on Evolutionary Computation, 1999, 3(4): 257-271.
[155] Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization[C]. Proc.of the EUROGEN 2001-Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, 2001, 95-100.
[156] Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II[J]. IEEE Trans on Evolutionary Computation, 2002, 6(2): 184-197.
[157] Srinivas N, Deb K. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms[J]. Evolutionary Computation, 1994, 2 (3): 221-248.
[158]郑向伟,刘弘.多目标进化算法研究进展[J].计算机科学, 2007, 34(7): 187-192.
[159] Zitzler E, Thiele L. Multiobjective optimization using evolutionary algorithms: a comparative case study and the strength Pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271.
[160] Zitzler E, Thiele L, Laumanns M, et al. Performance assessment of multiobjective optimizers: an analysis and review[J]. IEEE Transactions on Evolutionary Computation, 2003, 7(2): 117-132.
[161]邱志平,张宇星.改进遗传算法在飞机总体参数优化中的应用[J].北京航空航天大学学报, 2008, 34(10): 1182-1185.
[162] Pinedo M. Scheduling theory, algorithms, and system[M]. Prentice Hall, Upper Saddle River, New Jersy, 2002.
[163]孙志峻.智能制造系统车间生产优化调度[D].西安:西北工业大学. 2002.
[164] Kenichi I, Kensaku O. Flexible job-shop scheduling problem by genetic algorithm[J]. Transactions on Electronics, Information and Systems, 2009, 129(3): 505-511.
[165] Mohammad S M, Parviz F. Flexible job shop scheduling with tabu search algorithms[J].International Journal of Advanced Manufacturing Technology, 2007, 32(5-6): 563-570.
[166] Meriem E, Khaled G. Multi-agent approach based on tabu search for the flexible job shop scheduling problem[C]. Proceedings of the Sixth International Conference on Enterprise Information Systems, 2004: 22-28.
[167] Hitoshi T, Mitsuyoshi H. Comparison between machine flexibility and routing flexibility in bottleneck job shop[J]. Journal of Engineering Valuation and Cost Analysis, 2000, 3(4-5): 323-335.
[168] Scrich C R, Armentano V A, Laguna M. Tardiness minimization in a flexible job shop: A tabu search approach[J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103-115.
[169]魏巍,谭建荣,冯毅雄,张蕊.柔性工作车间调度问题的多目标优化方法研究[J].计算机集成制造系统, 2009, 15(8):1592-1598.
[170] Souad M, Fayech C B, et al. A novel particle swarm optimization approach for multiobjective flexible job shop scheduling problem[C]. Proceedings of the 5th International Conference on Informatics in Control, Automation and Robotics, 2008: 225-230.
[171]易树平.基础工业工程[M].北京:机械工业出版社, 2003.
[172]陈华平,谷峰,古春生,等.两级排序遗传算法在柔性工作车间调度中的应用[J].系统仿真学报. 2006, 18(6): 1717-1720.
[173]鞠海华,刘长安,张伟,等.基于带精英策略的NSGA_II遗传算法的车间作业调度研究[J].组合机床与自动化加工技术, 2008, 4: 15-19.
[174] Geoffrey V, Charles B J. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem[J]. European Journal of Operational Research, 2008, 190(2): 398-411.
[175] Shi R F, Zhou Y M, Zhou H. A hybrid evolutionary algorithm for bi-objective job shop scheduling problems[J]. Control and Decision, 2007, 22(11): 1228-1234.
[176] Tiente H, Rémy D, Daniel J, et al. Evaluation of mutation heuristics for the solving of multiobjective flexible job shop by an evolutionary algorithm[C]. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics,2002, 5: 655-660.
[177] Low C, Msu C Mi, Huang K I. Benefits of lot splitting in job-shop scheduling[J]. International Journal of Advanced Manufacturing Technology, 2004, 24(9-10): 773-780.
[178]苑丽红,崔广才.基于遗传算法的柔性车间批量调度研究[J].长春理工大学学报, 2005, 3: 11-13.
[179]顾启泰.离散事件系统建模与仿真[M].北京:清华大学出版社, 1999.
[180]王亚超,马汉武,等.生产物流系统建模与仿真-Witness系统及应用[M].北京:科学出版社, 2006.
[181]齐欢,王小平.系统建模与仿真[M].北京:清华大学出版社, 2004.
[182]陈华平,谷峰,卢冰原,等.自适应多目标遗传算法在柔性工作车间调度中的应用[J].系统仿真学报, 2006: 18(8): 2271-2288.
[183] White R E, Peason J N, Wilson J R. JIT manufacturing: A survey of implementations in small and large U.S. manufacturers[J]. Management Science. 1999, 45(1):1-15.
[184] Parviz F. A hybrid multi objective algorithm for flexible job shop scheduling[C]. Proceedings of World Academy of Science, Engineering and Technology, 2009, 38: 555-560.
[185] Scrich C R, Armentano V A, et al. Tardiness minimization in a flexible job shop: A tabu search approach[J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103-115.
[186] Imanipour N, Zegordi S H. A heuristic approach based on Tabu Search for early/tardy flexible job shop problems[J]. Scientia Iranica, 2006, 13(1): 1-13.
[187]吴悦,汪定伟.用遗传算法解模糊交货期下Flow Shop调度问题[J].系统工程理论与实践, 2: 2000: 109-112.
[188]宋晓宇,孟秋宏,曹阳.求解Job Shop调度问题的改进禁忌搜索算法[J].系统工程与电子技术, 2008, 30(1): 93-96.
[2]李光华,陈昌领,邵惠鹤.批处理过程优化调度研究综述_1_MILP调度方法的描述框架[J].化工自动化及仪表, 2002, 29(5) : 1-6.
[3]肖力墉,苏宏业,苗宇,等.制造执行系统功能体系结构[J].化工学报, 2010, 61(2): 359-364.
[4]周延佑,陈长年.多品种、单件、小批量生产和少品种、大批量生产解决方案的新发展[J].制造技术与机床, 2007, 5: 28-36.
[5]袁坤.智能制造系统车间生产计划与调度[D].南京:南京航空航天大学, 2007.
[6]鞠全勇.智能制造系统生产计划与车间调度的研究[D].南京:南京航空航天大学, 2007.
[7]钟雪灵.基于动态规划的分批排序算法[J].计算机工程与应用, 2010, 46(7): 229-231.
[8]张玉忠,王忠志,王长钰.分批排序的_转换引理_及其应用[J].系统科学与数学, 2002, 22(3): 328-333.
[9]牛海军,孙树栋. JIT方式下的单机分批调度问题研究[J].西安电子科技大学学报, 2002, 29(4): 444-460.
[10]张建伟,张保威,郭云飞.一类分批排序问题的复杂性分析及近似算法[J].计算机工程与应用, 2007, 43(3): 175-178.
[11]张召生,孔淑兰,马建华.求解多目标单机分批排序问题[J].山东大学学报, 2004, 39(2): 50-55.
[12]李曙光,李国君,王秀红.极小化加权完工时间和的无界批量机器并行调度问题[J].软件学报, 2006, 17(10): 2063-2068.
[13]徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述[J].计算机研究与发展, 2004, 41(2): 260-267.
[14]韩兵,席裕庚.多机器总完成时间和makespan近似最优的开放式车间调度方法[J].控制理论与应用, 2003, 20(6): 859-864.
[15]孙志峻,潘全科,朱剑英.基于遗传算法的多资源作业车间智能优化调度[J].中国机械工程, 2002, 13(24): 2104-2107.
[16]吴秀丽.多目标柔性作业车间调度技术研究[D].西安:西北工业大学, 2006.
[17]张朝勇.基于自然启发式算法的作业车间调度问题理论与应用研究[D].武汉:华中科技大学, 2006.
[18]金锋,吴澄.大规模生产调度问题的研究现状与展望[J].计算机集成制造系统, 2006,12(2): 161-169.
[19] Cook S A. The complexity of theorem proving procedures[C]. The proceedings of the Third Annual ACM Symposium on the Theory of Computing, Association of Computing Machinery, New York, 1971, 151-158.
[20] Lawler E L, Lenstra J K, Rinnooy Kan A H G. Recent developments in deterministic sequence and scheduling: a survey. In: dempster M A H et al. (Eds), Determinstic and Stochastic Scheduling. Reidel, Dordrecht, 1982, 35-73.
[21] Blazewicz J, Ecker K H, Schmidt G, et al. Scheduling in Computer and Manufacturing Systems[M]. Second Revised Edtition. Berlin: Springer-Verlag, 1996.
[22] Garey M R, Johnson D S. Computers and intractability: a guide to the theory of NP-comleteness[J]. San Francisco: Freeman, 1979.
[23]王万良.生产调度智能算法及其应用[M].北京:科学出版社, 2007.
[24]王书锋,邹益仁.车间作业调度_JSSP_技术问题简明综述[J].系统工程理论与实践, 2003, 1: 49-55.
[25] Ashour S, Hiremath S R. Branch-and-bound approach to the Job-shop scheduling problem[J]. International Journal of Production Research, 1973, 11(1): 47-58.
[26] Chen M. A mathematical programming model for system reconfiguration in a dynamic cellular manufacturing environment[J]. Annals of Operation Research, 1998, 77: 109-128.
[27] Gupta J, Darrow W P. The two-machine sequence dependent flow shop problem[J]. European Journal of Operational Research, 1986, 24(3):439-446.
[28] Fernandes S, Lourenco H R. A GRASP and branch-and-bound metaheuristic for the job-shop scheduling[C]. Lecture Notes in Computer Science, 2007, 4446(LNCS): 60-71, 2007- Proceedings of the 7th European Conference, EvoCOP 2007.
[29] Luh P B, ZhaoX, Wang Y J, et al. Lagrangian relaxation neural networks for job shop scheduling[J]. IEEE Transactions on Robotics and Automation, 2000, 16(1): 78-88.
[30] Jackson J R. Scheduling a production line to minimize maximum tardiness[J]. Research Report 43, Management Science Research Projects, University of California, Los Angeles, USA, 1955.
[31] Smith W E. Various optimizers for single stage production[J]. Naval Research Logistics Quarterly, 1956, 3: 59-66.
[32] Panwalkar S. A survey of scheduling rules[J]. Operation Research, 1977, 25(1): 45-61.
[33] Kuriyan K, et al. Scheduling network flowshops so as to minimize makespan[J]. Computers and chemical Engineering, 1989, 113(1-2): 187-200.
[34] Montazeri M, Van W L N. Analysis of scheduling rules for an FMS. International Journal ofProduction Research[J], 1990, 28: 785-802.
[35]高红,熊光椤.决策规则在仿真调度中的应用[J].控制与决策, 1995, 10(2): 114-118.
[36] Kanet J J, et al. Expert system in production scheduling[J]. European Journal of Operational Research, 1987, 29:51-59.
[37] Kim M, Lee I B. On-line rescheduling system for multi-purpose processes[J]. China-Korea Joint Work-shop on Process Systems Engineering. Hangzhou, China, 1997: 84-89.
[38]安政,苏春.基于规则和仿真的多机并行作业车间生产调度研究[J].工业工程, 2010, 13(1): 64-68.
[39]陈晓慧,张启忠.可重入式生产车间调度的计算机仿真与优化研究[J].计算机科学, 2009, 36(9): 297-302.
[40] Zhou D N, Cherkassky V, Baldwin T R, et al. Scaling neural network for job-shop scheduling[C]. Proceedings of the International Joint Conference on Neural Networks, 1990, 889-894.
[41] Foo S Y, Takefuji Y, Szu H. Job-shop scheduling based on modified Tank-Hopfield linear programming networks[J]. Engineering Applications of Artificial Intelligence, 1994,7(3): 321-327.
[42] Jain A S, Meeran S. Job-shop scheduling using neural networks[J]. International Journal of Production Research, 1998, 36(5): 1249-1272.
[43] Ibrahim S, El-Baz M A, Esh E. Neural networks for job shop scheduling problems[J] .Journal of Engineering and Applied Science, 2009, 56(2):169-183.
[44]奚立峰,周炳海,蔡建国,等.基于规则的人工神经网络FMS动态调度[J].机床与液压, 2002, 4: 32-55.
[45]张传芹,盛昭瀚.连续过程生产调度预警及专家系统的应用研究[J].信息与控制, 2002, 31(4): 300-314.
[46]王万良,吴启迪,徐新黎.基于Hopfield神经网络的作业车间生产调度方法[J].自动化学报, 2002, 28(5): 838-844.
[47]郭沛俊,袁一.化工过程集成智能生产调度系统开发[J].化工自动化及仪表, 1994, 21(5): 8-11.
[48] Fox M S, Allen B P, Smith S F, et al. ISIS: A Constraint-Directed Reasoning Approach to Job Shop Scheduling[R]. CMU-RI-TR-83-8, 1983: 25.
[49] Fox M S, Smith S F. Constraint-Based Scheduling in an Intelligent Logistics Support System: An Artificial Intelligence Approach. Sponsor: Air Force Office of Scientific Research, Bolling AFB, DC., 1986: 56.
[50] Potvin J Y, Smith S F. Flexible systems for the design of heuristic algorithms in complex ordomains, 1989.
[51] Collinot A, Le P C. Controlling the behavior of knowledge sources within SONIA[C]. Proceedings of the Hawaii International Conference on System Science, 1989, 3: 221-228.
[52] Anne C, Claude L P. Adapting the behavior of a job-shop scheduling system[J]. Decision Support Systems, 1991, 7(4): 341-353.
[53] Daniel F, Jens N, Heinz W, et al. Benchmarking and robust multi-agent-based production planning and control[J]. Engineering Applications of Artificial Intelligence, 2003, 16(4): 307-320.
[54]李飒,王云莉,段广洪,等.基于多智能体结构的车间调度方法[J].机械科学与技术, 2000, 19(6): 956-958.
[55]张宇,孙宪鹏,尹朝万,等.一种基于Agent的Job Shop调度模型[J].中国机械工程, 2001, 12(10): 1138-1141.
[56]徐新黎,应时彦,王万良.求解模糊柔性Job-shop调度问题的多智能体免疫算法[J].控制与决策, 2010, 25(2): 171-184.
[57] Wong T N, Leung C W, Mak K L, et al. Integrated process planning and scheduling/rescheduling - An agent-based approach[J]. International Journal of Production Research, 2006, 44(18-19): 3627-3655.
[58] Glover F. Future paths for integer programming and links to artificial intelligence[J]. Computers and Operations Research, 1986, 13: 533-549.
[59] Hansen P. The steeperest ascent mildest descent heuristic for combinatorial programming. In: Congress on Numerical Methods in Combinatiorial Optimization, Capri, Ttaly, 1986.
[60]童刚,李光泉,刘宝坤.一种用于Job-Shop调度问题的改进禁忌搜索算法[J].系统工程理论与实践, 2001, 9: 48-52.
[61]潘全科,朱剑英.一类解决Job Shop问题的禁忌搜索算法[J].中国机械工程, 2006, 17(5): 536-539.
[62]宋晓宇,朱云龙,尹朝万,等.求解模糊Job Shop调度问题的改进禁忌搜索算法[J].沈阳建筑大学学报(自然科学版), 2006, 22(5): 841-845.
[63]张超勇,高亮,李新宇,等.基于进化禁忌算法的Job-Shop调度问题研究[J].华中科技大学学报(自然科学版), 2009, 37(8): 80-95.
[64]宋晓宇,曹阳,孟秋宏.求解Job Shop调度问题的粒子群算法研究[J].系统工程与电子技术, 2008, 30(12): 2398-2401.
[65]姜思杰,张付亮,王孔茂.基于遗传和禁忌算法求解一类车间调度问题[J].计算机集成制造系统, 2003, 9(11): 984-988.
[66]梁旭,黄明.禁忌-并行遗传算法在作业车间调度中的应用[J].计算机集成制造系统,2005, 11(5): 678-681.
[67]梁迪,谢里阳,隋天中,等.基于遗传和禁忌搜索算法求解双资源车间调度问题[J].东北大学学报(自然科学版), 2006, 27(8): 895-898.
[68] Metropolis N, Rosenbluth A W, Rosenbluth M N, et al. Equation of state calculations by fast computing machines[J]. The Journal of Chemical Physics, 1953, 21(6): 1087-1092.
[69] Grefenstette J J. Optimization of control parameters for genetic algorithms[J]. IEEE Transactions on System, Man and Cybernetics, 1988, 16(1): 122-128.
[70]张瑞,吴澄.求解Job Shop问题的一种免疫模拟退火算法[J].中国机械工程, 2008, 19(23): 2824-2829.
[71]刘晓霞,谢里阳,陶泽,等.基于生产费用的柔性作业车间调度优化[J].东北大学学报(自然科学版), 2008, 29(4): 261-564.
[72]夏蔚军,吴智铭.基于混合微粒群优化的多目标柔性Job-shop调度[J].控制与决策, 2005, 20(2): 137-141.
[73]王万良,吴启迪.基于Hopfield神经网络求解作业车间调度问题的新方法[J].计算机集成制造系统, 2001, 7(12): 7-12.
[74] J H Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence[M]. Cambridge, MA: MIT Press, 1992.
[75]雷英杰,张善文,李续武,等. Matlab遗传算法工具箱及应用[M].西安:西安电子科技大学出版社, 2005.
[76] Kim J H, Myung H. A two-phase evolutionary programming for general constrained optimization problem[C]. In Proc. of the Fifth Conference on Evolutionary Programming, San Diego, 1996.
[77] Michalewicz Z. Genetic algorithms, numberical optimization, and constraints[C]. In Eshelman: 151-158.
[78] Orvosh D, Davis L. Using a genetic algorithm to optimize problems with feasibility constraints[C]. IEEE Conference on Evolutionary Computation, 1994, 2: 548-553.
[79] Myung H, Kim J H. Hybrid evolutionary programming for heavily constrained problems[J]. Bio-Sysetms, 1996, 38: 29-43.
[80] Coello C A C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art[J]. Comput Methods Appl Mech Engry, 2002, 191: 1245-1287.
[81]玄光男,程润伟.遗传算法与工程设计[M].北京:科学出版社. 2000.
[82]周辉仁,郑丕谔,安小会,等.基于遗传算法求解Job Shop调度优化的新方法[J].系统仿真学报, 2009, 21(11): 3295-3306.
[83]席卫东,乔兵,朱剑英.基于改进遗传算法的柔性作业车间调度[J].哈尔滨工业大学学报, 2007, 39(7): 1151-1153.
[84]张国辉,高亮,李培根,等.改进遗传算法求解柔性作业车间调度问题[J].机械工程学报, 2009, 45(7): 146-151.
[85]赵良辉,邓飞其.一种求解作业车间调度问题的混和遗传算法[J].系统工程与电子技术, 2007, 29(6): 899-902.
[86]齐德新,刘永贤,张树良.单染色体遗传算法在制造系统作业调度中的应用[J].辽宁工程技术大学学报, 2006, 25(6): 911-913.
[87]张维存,郑丕谔,吴晓丹.基于主-从遗传算法求解柔性调度问题[J].计算机集成制造系统, 2006, 12(8): 1241-1245.
[88]庄新村,卢宇灏,李从心.基于遗传算法的车间调度问题[J].计算机工程, 2006, 32(1): 193-197.
[89]蔡良伟,张基宏,李霞.作业车间调度问题的多种群遗传算法[J].电子学报, 2005, 33(6): 991-994.
[90]蔡良伟,李霞. Job Shop调度问题的遗传退火算法[J].系统工程与电子技术, 2004, 26(11): 1698-1700.
[91]马佳,石刚,高立群,等.求解FJSP的自适应免疫遗传算法[J].系统仿真学报, 2009, 21(12): 3609-3613.
[92]赵韩,高先圣,姜康,等.基于免疫遗传算法的多目标柔性作业车间调度研究[J].系统仿真学报, 2008, 20(22): 6163-6168.
[93]司书宾,孙树栋,徐娅萍.求解Job-Shop调度问题的多种群双倍体免疫算法研究[J].西北工业大学学报, 2007, 25(1): 27-31.
[94]刘胜辉,张淑丽,王波,等.单件车间调度问题的改进型病毒进化遗传算法[J],电机与控制学报, 2008, 12(2): 234-238.
[95] Dorigo M, Maniezzo V, Colorni A. Ant System: Optimization by a colony of cooperation agents[J]. IEEE Transactions on SMC, 1996, 26(1): 8-41.
[96]张纪会.自适应蚁群算法[J].控制理论与应用, 2000, 17(1): 1-8.
[97]陈美军,张志胜,史金飞.基于自适应蚁群算法的多约束车辆路径问题[J].东南大学学报, 2008, 38(1): 37-42.
[98]彭沛夫,林亚军,胡斌,等.基于遗传因子的自适应蚁群算法最优PID控制[J].电子学报, 2006, 34(6): 1109-1113.
[99] Favuzza S, Graditi G, Sanseverino E, et al. Adaptive and dynamic ant colony search algorithm for optimal distribution systems reinforcement strategy[J]. Applied Intelligence,2006, 24(1): 31-42.
[100]张杰慧,何中市,王健,等.基于自适应蚁群算法的组合式特征选择算法[J].系统仿真学报, 2009, 21(6): 1605-1614.
[101] Shan M Y, Li G. Auto-adapted ant colony optimization algorithm for wavelet network and its applications[C]. 2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006 (142440-4665), 2006: 2437-2442.
[102]傅鹏,张德运,马兆丰,等.网络中基于模拟退火_蚁群算法的QoS路由发现方法[J].西安交通大学学报, 2006, 40(2):179-190.
[103] Musa R, Chen F F Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem[J]. International Journal of Advanced Manufacturing Technology, 2008, 37(7-8): 837-850.
[104]毛宁,顾军华,谭庆,等.蚁群遗传混合算法[J].计算机应用, 2006, 26(7): 1692-1696.
[105] Keramati A, Azadeh A, Ebrahimipour V, et al. Application of a hybrid genetic-ant colony algorithm for exploring the relationship between IT and performance of organizations[J]. IIE Annual Conference and Expo 2008:1107-1112.
[106]张维存,郑丕谔,吴晓丹.基于蚁群粒子群算法求解多目标柔性调度问题[J].计算机应用, 2007, 27(4): 936-941.
[107] Shelokar P S, Siarry P, Jayaraman V K, et al. Particle swarm and ant colony algorithms hybridized for improved continuous optimization[J]. Applied Mathematics and Computation (0096-3003), 2007, 188(1): 129-142.
[108]王万良,赵澄,熊婧,等.基于改进蚁群算法的柔性作业车间调度问题的求解方法[J].系统仿真学报, 2008, 20(16): 4326-4329.
[109]张晴,陈知美,顾幸生.具有滚动优化特性的改进型蚁群算法及其在提前/拖期Job Shop问题中的应用[J].华东理工大学学报(自然科学版), 2008, 34(1): 112-116.
[110]宋晓宇,朱云龙,尹朝万,等.应用混合蚁群算法求解模糊作业车间调度问题[J].计算机集成制造系统, 2007, 13(1): 105-119.
[111]宋晓宇,王丹.求解Job Shop调度问题的混合蚁群算法研究[J].计算机工程, 2007, 33(4): 218-219.
[112]陈知美,顾幸生.改进型蚁群算法在Job Shop问题中的应用[J]. 2006, 332(4): 466-450.
[113] Kennedy J, Eberhart R C. Particle swarm optimisation[C]. IEEE International Conference on Neural Networks, 1995: 1942-1948.
[114]谷峰,陈华平,卢冰原,等.粒子群算法在柔性工作车间调度中的应用[J].系统工程, 2005, 23(9): 20-23.
[115]潘全科,王文宏,朱剑英.基于粒子群优化和模拟退火的混合调度算法[J].中国机械工程, 2006, 17(10): 1044-1064.
[116]潘全科,王文宏,潘群,等.解决JOB SHOP问题的粒子群优化算法[J].机械科学与技术, 2006, 25(6): 675-679.
[117]柳毅,叶春明,沈运红.应用改进微粒群算法求解Job-shop调度问题[J].系统工程与电子技术, 2006, 28(4): 602-606.
[118] Gomez A, Cuevas R, De L F D, et al. New metaheuristic for the Job Shop Scheduling Problem with PSO[C]. Proceedings of the 2008 International Conference on Artificial Intelligence, ICAI 2008 and Proceedings of the 2008 International Conference on Machine Learning, Models, Technologies and Applications, 2008: 552-553.
[119] Sha D Y,Lin H H. A multi-objective PSO for job-shop scheduling problems. Expert Systems with Applications, 2010, 37(2): 1065-1070.
[120] Girish B S, Jawahar N. A particle swarm optimization algorithm for flexible job shop scheduling problem[C]. IEEE International Conference on Automation Science and Engineering, CASE 2009, 2009: 298-303.
[121]鞠全勇,朱剑英.多目标批量生产柔性作业车间优化调度[J].机械工程学报, 2007, 43(8): 148-154.
[122]邓慈云,陈焕文,刘泽文,等.一种求解Job-Shop调度问题的混合自适应变异粒子群算法[J].计算机工程与科学, 2010, 32(1): 47-50.
[123]李俊青,潘全科,王玉亭,等.求解Job shop的一种快速混合算法[J].微电子学与计算机, 2010, 27(1): 113-119.
[124] Sh D J, He J, Wang L. Job shop scheduling problem with a novel particle swarm optimization based on tabu search[C]. 2009 International Conference on Artificial Intelligence and Computational Intelligence, AICI 2009, 2009: 97-100.
[125] LinTsung L, Horng S J, Kao T W, et al. An efficient job-shop scheduling algorithm based on particle swarm optimization[J]. Expert Systems with Applications, 2010, 37(3): 2629-2636.
[126]冯根尧,颜蕾.生产与运作管理[M].重庆大学出版社, 2003.
[127] Karmarkar U S, Kekre S. Lot-sizing in multi-item multi-machine job shops[J]. IIE Transactions, 1985, 17: 290-298.
[128]潘全科,朱剑英.多工艺路线的批量生产调度优化[J].机械工程学报, 2004, 40(4): 36-39.
[129]熊红云,何钺.面向柔性生产线的分批与调度集成模型及其遗传启发算法[J].长沙铁道学院学报, 2001, 19(1): 51-55.
[130] Jeong H L, Park J, Leachman R C. A Batch splitting method for a job shop scheduling problem in an MRP environment[J]. International Journal of Production Research, 1999, 37(15): 3583-3598.
[131]白俊杰,龚毅光,王宁生,等.多目标柔性作业车间分批优化调度[J],计算机集成制造系统, 2010, 16(2): 396-403.
[132]李崇斌,何桢.平行顺序移动的同顺序排序法研究[J].成组技术与生产现代化, 1990, 3.
[133]周焯华,晏平,杨波.一般作业车间零件提前/拖期的数学模型研究[J].重庆建筑大学学报, 1999, 21(3): 110-113.
[134]周亚勤,李蓓智,杨建国.考虑批量和辅助时间等生产工况的智能调度方法[J].机械工程学报, 2006, 42(1): 52-56.
[135]周泓,张惠民.求解含调整时间排序问题的混合遗传算法[J].航空学报, 2001, 22(2): 180-183.
[136] Kim S, Bobrowski P. Impact of Sequence-dependent Setup Time on Jobshop Scheduling Performance[J]. International Journal of Production Research, 1992, 32: 1503-1520.
[137] Zhou C, Egbelu P J. Scheduling in a Manufacturing Shop with Sequence-dependent Setups[J]. Robotics and Computer Integrated Manufacturing, 1989, 5: 73-81.
[138] Aanen E, Gaalman C, Nawijn W. A Scheduling Approach for a Flexible Manufacturing System[J]. International Journal of Production Research, 1993, 31: 2369-2385.
[139] Choi I C, Korkmaz O. Job Shop Scheduling with Separable Sequence Dependent Setups[J]. Annals of Operations Research, 1997, 70: 155-170.
[140]周泓;张惠民.求解多目标作业排序问题的遗传算法[J].系统工程理论与实践, 2001, 8: 1-8.
[141]张书珩.核心竞争力[M]:北京:金城出版社, 2005: 1-2.
[142]郑金华,蒋浩,邝达,等.用擂台赛法则构造多目标Pareto最优解集的方法[J].软件学报, 2007, 18(6): 1287-1297.
[143]林锉云,董加礼.多目标优化的方法与理论[M].吉林:吉林教育出版社, 1992.
[144]甘应爱,田丰,等.运筹学[M].北京:清华大学出版社, 1999: 448-461.
[145]吴秀丽,孙树栋,余建军,等.多目标柔性作业车间调度优化研究[J].计算机集成制造系统, 2006, 12(5): 731-736.
[146]宋立锋,韦岗,王群生.以多目标优化的轮廓定位分割视频对象[J].电子与信息学报, 2002, 24(11): 1551-1558.
[147]贺国先.多目标规划在铁路零担货运中转装车问题中的应用[J].中国铁道科学, 2007, 28(4): 111-116.
[148]张土乔,许刚,吕谋,等.用于供水系统直接优化调度的蚁群改进算法[J].计算机集成制造系统, 2006, 12(6): 918-923.
[149]万世明.矿井设计多目标优化法探讨[J].煤炭工程, 1991,1: 6-8.
[150]周根贵.求解多目标最优化问题的功效系数法[J].上海理工大学学报, 1987, 9(3):103-108.
[151] Fonseca C M, Fleming P J. An overview of evolutionary algorithms in multi-objective optimization[J]. Evolutionary Computation, 1995, 3(1): 1-16.
[152] Schaffer J D. Multiple objective optimization with vector evaluated genetic algorithms[C]. Proceeding of the First International Conference on Genetic Algorithms. New Jersey, Britain: IEE, 1985.
[153] Cheol G L, Dong H C, Hyum K J, et al. Niching genetic Algorithm with restricted competition selection for multimodal function optimization[J]. IEEE Transactions on Maqnetics, 1999, 35(3): 1722-1725.
[154] Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach[J]. IEEE Trans.on Evolutionary Computation, 1999, 3(4): 257-271.
[155] Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization[C]. Proc.of the EUROGEN 2001-Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, 2001, 95-100.
[156] Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II[J]. IEEE Trans on Evolutionary Computation, 2002, 6(2): 184-197.
[157] Srinivas N, Deb K. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms[J]. Evolutionary Computation, 1994, 2 (3): 221-248.
[158]郑向伟,刘弘.多目标进化算法研究进展[J].计算机科学, 2007, 34(7): 187-192.
[159] Zitzler E, Thiele L. Multiobjective optimization using evolutionary algorithms: a comparative case study and the strength Pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271.
[160] Zitzler E, Thiele L, Laumanns M, et al. Performance assessment of multiobjective optimizers: an analysis and review[J]. IEEE Transactions on Evolutionary Computation, 2003, 7(2): 117-132.
[161]邱志平,张宇星.改进遗传算法在飞机总体参数优化中的应用[J].北京航空航天大学学报, 2008, 34(10): 1182-1185.
[162] Pinedo M. Scheduling theory, algorithms, and system[M]. Prentice Hall, Upper Saddle River, New Jersy, 2002.
[163]孙志峻.智能制造系统车间生产优化调度[D].西安:西北工业大学. 2002.
[164] Kenichi I, Kensaku O. Flexible job-shop scheduling problem by genetic algorithm[J]. Transactions on Electronics, Information and Systems, 2009, 129(3): 505-511.
[165] Mohammad S M, Parviz F. Flexible job shop scheduling with tabu search algorithms[J].International Journal of Advanced Manufacturing Technology, 2007, 32(5-6): 563-570.
[166] Meriem E, Khaled G. Multi-agent approach based on tabu search for the flexible job shop scheduling problem[C]. Proceedings of the Sixth International Conference on Enterprise Information Systems, 2004: 22-28.
[167] Hitoshi T, Mitsuyoshi H. Comparison between machine flexibility and routing flexibility in bottleneck job shop[J]. Journal of Engineering Valuation and Cost Analysis, 2000, 3(4-5): 323-335.
[168] Scrich C R, Armentano V A, Laguna M. Tardiness minimization in a flexible job shop: A tabu search approach[J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103-115.
[169]魏巍,谭建荣,冯毅雄,张蕊.柔性工作车间调度问题的多目标优化方法研究[J].计算机集成制造系统, 2009, 15(8):1592-1598.
[170] Souad M, Fayech C B, et al. A novel particle swarm optimization approach for multiobjective flexible job shop scheduling problem[C]. Proceedings of the 5th International Conference on Informatics in Control, Automation and Robotics, 2008: 225-230.
[171]易树平.基础工业工程[M].北京:机械工业出版社, 2003.
[172]陈华平,谷峰,古春生,等.两级排序遗传算法在柔性工作车间调度中的应用[J].系统仿真学报. 2006, 18(6): 1717-1720.
[173]鞠海华,刘长安,张伟,等.基于带精英策略的NSGA_II遗传算法的车间作业调度研究[J].组合机床与自动化加工技术, 2008, 4: 15-19.
[174] Geoffrey V, Charles B J. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem[J]. European Journal of Operational Research, 2008, 190(2): 398-411.
[175] Shi R F, Zhou Y M, Zhou H. A hybrid evolutionary algorithm for bi-objective job shop scheduling problems[J]. Control and Decision, 2007, 22(11): 1228-1234.
[176] Tiente H, Rémy D, Daniel J, et al. Evaluation of mutation heuristics for the solving of multiobjective flexible job shop by an evolutionary algorithm[C]. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics,2002, 5: 655-660.
[177] Low C, Msu C Mi, Huang K I. Benefits of lot splitting in job-shop scheduling[J]. International Journal of Advanced Manufacturing Technology, 2004, 24(9-10): 773-780.
[178]苑丽红,崔广才.基于遗传算法的柔性车间批量调度研究[J].长春理工大学学报, 2005, 3: 11-13.
[179]顾启泰.离散事件系统建模与仿真[M].北京:清华大学出版社, 1999.
[180]王亚超,马汉武,等.生产物流系统建模与仿真-Witness系统及应用[M].北京:科学出版社, 2006.
[181]齐欢,王小平.系统建模与仿真[M].北京:清华大学出版社, 2004.
[182]陈华平,谷峰,卢冰原,等.自适应多目标遗传算法在柔性工作车间调度中的应用[J].系统仿真学报, 2006: 18(8): 2271-2288.
[183] White R E, Peason J N, Wilson J R. JIT manufacturing: A survey of implementations in small and large U.S. manufacturers[J]. Management Science. 1999, 45(1):1-15.
[184] Parviz F. A hybrid multi objective algorithm for flexible job shop scheduling[C]. Proceedings of World Academy of Science, Engineering and Technology, 2009, 38: 555-560.
[185] Scrich C R, Armentano V A, et al. Tardiness minimization in a flexible job shop: A tabu search approach[J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103-115.
[186] Imanipour N, Zegordi S H. A heuristic approach based on Tabu Search for early/tardy flexible job shop problems[J]. Scientia Iranica, 2006, 13(1): 1-13.
[187]吴悦,汪定伟.用遗传算法解模糊交货期下Flow Shop调度问题[J].系统工程理论与实践, 2: 2000: 109-112.
[188]宋晓宇,孟秋宏,曹阳.求解Job Shop调度问题的改进禁忌搜索算法[J].系统工程与电子技术, 2008, 30(1): 93-96.