应用齐套概念的离散制造业生产调度问题研究
|
摘要
本论文主要研究齐套概念下的离散制造业生产调度问题。在多品种少批量或单件小批生产模式下,生产装配型制造企业生产管理中的关键问题之一就是缺件。齐套问题严重影响生产过程的同步进行。其次,以MRP为核心的管理信息系统,不能清楚反映不同工件之间的先后关系和产品齐套性,影响了制造业管理信息化软件的应用效果。第三,传统的生产调度研究,忽视了工件的可用性和订单的重要性。本论文主要研究面向齐套概念的两类基本调度问题:综合作业调度问题(CJSSP)和订单作业调度问题(COSPJS),主要目的是改善生产管理系统的性能以及提高客户对企业的满意程度。本论文的主要研究工作包括如下六个方面:
(1)综述了齐套概念研究现状,在分析齐套概念内涵的基础上,给出齐套概念的定义,研究了齐套概念的应用,提出了面向齐套的生产调度模式。在综述含装配约束的调度问题研究现状、分析生产管理和调度理论研究中存在问题的基础上,提出了CJSSP概念,给出了三种分类方法,分析了CJSSP的涵义与用途。在系统描述CJSSP的基础上,建立了单产品和多产品问题的数学模型。
(2)研究了在不可行域中求解CJSSP的遗传算法。在分析CJSSP特点的基础上,采用基于工序的扩展编码方案,提出基于选择解码字符串解码方法,从而给出了处理装配约束问题和不可行染色体的一种有效方法,对根据FT10构造的单产品和多产品CJSSP求解结果表明,遗传算法是可行和有效的。在总结遗传算法的基础上,提出了基于不可行域的CJSSP遗传算法概念,其关键技术是染色体转换方法。
(3)提出了四种染色体转换方法。综述了约束处理技术的现状,提出了染色体转换的四项要求,设计并实现了四种转换方法,遗传算法应用实验说明了根右移子树归位法和基于路径表的扫描换位法转换结果最好,而且前者具有较好的综合性能。
(4)提出了四种度量染色体转换质量的性能指标。在染色体语义分析的基础上,提出了染色体基因保位度、父项装配体基因右移量、父项装配体基因位移量和种群转换熵损失四种染色体转换度量指标,性能测试实验和遗传算法应用实验均得到了很好结果,证实了所设计定量指标的有效性。
(5)研究了在可行域中求解CJSSP的遗传算法。在前面研究的基础上,提出了基于染色体转换的初始种群产生方法,采用分而治之的策略,综合应用编码方法和遗传操作算子来保证染色体的可行性,提出了装配体分类和可操作基因串两个核心概念,依此概念为基础设计了交叉与变异算子,对构造问题和文献实际问题的求解结果,以及与复杂规则算法结果的对比,证实了所设计遗传算法的优越性能。
(6)研究了订单作业调度问题。综述了订单作业调度相关问题研究现状,提出了COSPJS概念,建立了COSPJS数学模型,提出了基于订单的交叉算子和变异算子,采用自适应交叉变异和基于相似性交叉技术,设计的遗传算法解决了普通遗传算法中解空间的适应值集聚难题,对较大规模的构造问题测试表明了算法的有效性。
本论文研究表明,可以应用齐套概念有效解决离散制造企业广泛存在的缺件问题,CJSSP和COSPJS是面向齐套的生产调度的两类基本问题,不但具有理论意义而且具有实际应用价值,可以用遗传算法来求解这两类难题,从而得到优化的作业生产调度方案。
The major intention of this dissertation is to research production scheduling in the discrete manufacturing underlying complete kit(CK).In high-variety low-volume(HVLV) or in one-of-a kind production(OKP) environment,shortage of components is the common things the machining-and-assembly type enterprises confronted with.It has strong impact on the synchronization of the manufacturing process.Moreover,the management information system(MIS) applied in enterprise centered by material requirements planning(MRP) did not provide the precedence relationship among jobs and the degree of product complete kit clearly, and this have already wakened the performance of the manufacturing system.Still further,the traditional production scheduling researches ignored the job availability and the importance of customer order.This dissertation researches two basic kinds of production scheduling problem toward complete kit:the complete job shop scheduling problem(CJSSP) and the customer order scheduling problem in job shop(COSPJS),with the motive to improve the performance of manufacturing system and enhance the satisfaction level of customers.The main research work lies in six aspects as follows.
(1) The state-of-the-art of the literature concerning CK concept are surveyed.On the base of CK connotation analyses,CK terms are defined and CK application problem are traversed. Moreover,CK-oriented production scheduling paradigm is proposed.On the foundation of production scheduling overview involved assembly constraint and production theory analysis, this thesis put forward CJSSP concept.CJSSP are classified according three kinds,and its meaning and purpose are gathered up.Based on the systematic problem description,the single-product and multi-product model of CJSSP are established.
(2) The infeasible search space based genetic algorithm(GA) for CJSSP are coined. The CJSSP features are explored.The extended operation-based representation is adopted in GA and the selective decoding string(SDS) is configured to deal with the infeasible chromosomes caused by the assembly constraint,therefore constraint-handling technique comes into being.The computation results indicate the feasibility and validity of the proposed approach using single- and multi-CJSSP adapted from the famous FT10 benchmark.The findings are summed up so that the feasible search space based GA are proposed.The infeasible chromosomes conversion technique is the key of it.
(3) Four chromosome conversion approaches are suggested.The constraint-handling techniques are reviewed.Four conversion approaches are designed and realized based on the four requirements proposed for the conversion.Computational results indicate that all methods are viable in application,though different in speed and quality,and consistent with observation and GA application test results.Among them SLRRLS(subtree locus reversion based on root left shift) and CIP(circulatory interchanging based on pathway) are the best in quality,but the former executes rapider.
(4) Four metrics for conversion quality are defined.Based on the semantic analysis of chromosome,four metrics:the gene position-preserving degree of chromosome、the gene locus right shift of parent constituents、the gene locus displacement of parent constituents and entropy loss of conversion population are designed.Both the performance tests and GA application results are conducted,the results differentiate the conversion approaches remarkably well so the metrics are confirmed convincingly.
(5) The feasible search space based genetic algorithm(GA) for CJSSP are advanced. Based on the above-mentioned outcome,chromosome conversion based initial population construction is proposed.A divide-and-conquer strategy approach is adopted to maintain chromosome's feasibility:operation-based representation overcomes the precedence constraints while genetic operators tackle the assembly constraints.Two core concepts, constituent type and operable gene string,are defined to build crossover and mutation.The genetic algorithm is tested on both practical instances and problems adapted from JSSP benchmarks.Comparison between the GA results and that of some sophisticated heuristics validated the GA to be the better.
(6) COSPJS is studied.The literature of the customer order related scheduling problems are summarized.COSPJS is modeled mathematically.The self-adaptation crossover and mutation and the similarity-based crossover technique are adopted in the GA.They assist customer order-based crossover and customer order end shift that are created to overcome fitness value conglomeration,to solve COSPJS successfully.Large constructed benchmarks are used to test the performance of GA.
The research results in this dissertation demonstrate that CK concept is very useful to deal with shortage of components widely existed in production management of discrete manufacturing.Both CJSSP and COSPJS are the two basic production scheduling problems towards CK.They are of importance theoretically and valuable in practice.Genetic algorithms are powerful to solve these two nearly intractable problems,so as to yield favorable schedules in job shop.
(1)综述了齐套概念研究现状,在分析齐套概念内涵的基础上,给出齐套概念的定义,研究了齐套概念的应用,提出了面向齐套的生产调度模式。在综述含装配约束的调度问题研究现状、分析生产管理和调度理论研究中存在问题的基础上,提出了CJSSP概念,给出了三种分类方法,分析了CJSSP的涵义与用途。在系统描述CJSSP的基础上,建立了单产品和多产品问题的数学模型。
(2)研究了在不可行域中求解CJSSP的遗传算法。在分析CJSSP特点的基础上,采用基于工序的扩展编码方案,提出基于选择解码字符串解码方法,从而给出了处理装配约束问题和不可行染色体的一种有效方法,对根据FT10构造的单产品和多产品CJSSP求解结果表明,遗传算法是可行和有效的。在总结遗传算法的基础上,提出了基于不可行域的CJSSP遗传算法概念,其关键技术是染色体转换方法。
(3)提出了四种染色体转换方法。综述了约束处理技术的现状,提出了染色体转换的四项要求,设计并实现了四种转换方法,遗传算法应用实验说明了根右移子树归位法和基于路径表的扫描换位法转换结果最好,而且前者具有较好的综合性能。
(4)提出了四种度量染色体转换质量的性能指标。在染色体语义分析的基础上,提出了染色体基因保位度、父项装配体基因右移量、父项装配体基因位移量和种群转换熵损失四种染色体转换度量指标,性能测试实验和遗传算法应用实验均得到了很好结果,证实了所设计定量指标的有效性。
(5)研究了在可行域中求解CJSSP的遗传算法。在前面研究的基础上,提出了基于染色体转换的初始种群产生方法,采用分而治之的策略,综合应用编码方法和遗传操作算子来保证染色体的可行性,提出了装配体分类和可操作基因串两个核心概念,依此概念为基础设计了交叉与变异算子,对构造问题和文献实际问题的求解结果,以及与复杂规则算法结果的对比,证实了所设计遗传算法的优越性能。
(6)研究了订单作业调度问题。综述了订单作业调度相关问题研究现状,提出了COSPJS概念,建立了COSPJS数学模型,提出了基于订单的交叉算子和变异算子,采用自适应交叉变异和基于相似性交叉技术,设计的遗传算法解决了普通遗传算法中解空间的适应值集聚难题,对较大规模的构造问题测试表明了算法的有效性。
本论文研究表明,可以应用齐套概念有效解决离散制造企业广泛存在的缺件问题,CJSSP和COSPJS是面向齐套的生产调度的两类基本问题,不但具有理论意义而且具有实际应用价值,可以用遗传算法来求解这两类难题,从而得到优化的作业生产调度方案。
The major intention of this dissertation is to research production scheduling in the discrete manufacturing underlying complete kit(CK).In high-variety low-volume(HVLV) or in one-of-a kind production(OKP) environment,shortage of components is the common things the machining-and-assembly type enterprises confronted with.It has strong impact on the synchronization of the manufacturing process.Moreover,the management information system(MIS) applied in enterprise centered by material requirements planning(MRP) did not provide the precedence relationship among jobs and the degree of product complete kit clearly, and this have already wakened the performance of the manufacturing system.Still further,the traditional production scheduling researches ignored the job availability and the importance of customer order.This dissertation researches two basic kinds of production scheduling problem toward complete kit:the complete job shop scheduling problem(CJSSP) and the customer order scheduling problem in job shop(COSPJS),with the motive to improve the performance of manufacturing system and enhance the satisfaction level of customers.The main research work lies in six aspects as follows.
(1) The state-of-the-art of the literature concerning CK concept are surveyed.On the base of CK connotation analyses,CK terms are defined and CK application problem are traversed. Moreover,CK-oriented production scheduling paradigm is proposed.On the foundation of production scheduling overview involved assembly constraint and production theory analysis, this thesis put forward CJSSP concept.CJSSP are classified according three kinds,and its meaning and purpose are gathered up.Based on the systematic problem description,the single-product and multi-product model of CJSSP are established.
(2) The infeasible search space based genetic algorithm(GA) for CJSSP are coined. The CJSSP features are explored.The extended operation-based representation is adopted in GA and the selective decoding string(SDS) is configured to deal with the infeasible chromosomes caused by the assembly constraint,therefore constraint-handling technique comes into being.The computation results indicate the feasibility and validity of the proposed approach using single- and multi-CJSSP adapted from the famous FT10 benchmark.The findings are summed up so that the feasible search space based GA are proposed.The infeasible chromosomes conversion technique is the key of it.
(3) Four chromosome conversion approaches are suggested.The constraint-handling techniques are reviewed.Four conversion approaches are designed and realized based on the four requirements proposed for the conversion.Computational results indicate that all methods are viable in application,though different in speed and quality,and consistent with observation and GA application test results.Among them SLRRLS(subtree locus reversion based on root left shift) and CIP(circulatory interchanging based on pathway) are the best in quality,but the former executes rapider.
(4) Four metrics for conversion quality are defined.Based on the semantic analysis of chromosome,four metrics:the gene position-preserving degree of chromosome、the gene locus right shift of parent constituents、the gene locus displacement of parent constituents and entropy loss of conversion population are designed.Both the performance tests and GA application results are conducted,the results differentiate the conversion approaches remarkably well so the metrics are confirmed convincingly.
(5) The feasible search space based genetic algorithm(GA) for CJSSP are advanced. Based on the above-mentioned outcome,chromosome conversion based initial population construction is proposed.A divide-and-conquer strategy approach is adopted to maintain chromosome's feasibility:operation-based representation overcomes the precedence constraints while genetic operators tackle the assembly constraints.Two core concepts, constituent type and operable gene string,are defined to build crossover and mutation.The genetic algorithm is tested on both practical instances and problems adapted from JSSP benchmarks.Comparison between the GA results and that of some sophisticated heuristics validated the GA to be the better.
(6) COSPJS is studied.The literature of the customer order related scheduling problems are summarized.COSPJS is modeled mathematically.The self-adaptation crossover and mutation and the similarity-based crossover technique are adopted in the GA.They assist customer order-based crossover and customer order end shift that are created to overcome fitness value conglomeration,to solve COSPJS successfully.Large constructed benchmarks are used to test the performance of GA.
The research results in this dissertation demonstrate that CK concept is very useful to deal with shortage of components widely existed in production management of discrete manufacturing.Both CJSSP and COSPJS are the two basic production scheduling problems towards CK.They are of importance theoretically and valuable in practice.Genetic algorithms are powerful to solve these two nearly intractable problems,so as to yield favorable schedules in job shop.
引文
[1]张建林,魏大涛.多品种小批量生产管理信息系统的需求分析.航天制造技术.2006,(5):32-35.
[2]李随成,吴生祥,董正辉.多品种小批量生产技术与组织管理的发展动向.西安工业学院学报,1997,17(3):242-247.
[3]Johnson S M.Optimal two-and three-stage production scheduling with set-up times included.Navel Research Logistics Quarterly.1954,1:64-68.
[4]Mellor.A Review of Job Shop Scheduling.Operational Research Quarterly.1966,17(2):161-171.
[5]Conway R W,Maxweland W L,Miller L W.Theory of scheduling.Reading Mass:Addison-Wesley,1967.
[6]Garey M R,Johnson D S,Ravi Sethi.The complexity of flowshop and jobshop scheduling.Mathematics of Operations Research,1976,1(2):117-129.
[7]Panwalkar S S,Iskander W.A survey of scheduling rules.Operations Research,1977,25(1):45-61.
[8]Baker K R.Introduction to sequencing and scheduling,Wiley,New York,1974.
[9]Stenphen,Graves C.A Review of Production Scheduling.Ops.Res.,1981,29(4):646-675.
[10]Rodammer F A,White K e.A recent survey of production scheduling.IEEE Trans on Systems Man and Cybernetics,1988,18(6):841-851.
[11]Groce F D,Tadei R,Volta G.A genetic algorithm for the job shop problem.Computers and Operations Research,1995,22(1):15-24.
[12]Foo Y S,Takefuji Y.Stochastic neural networks for solving job-shop scheduling:part1.Problem representation,Stochastic neural networks for solving job-shop scheduling:Part2.Architecture and simulations.In:IEEE Int Conf on NNS,San Diego,1998.
[13]D' Souza K A,Khator S K.A survey of Petri net applications in modeling controls for automated manufacturing systems.Computers in Industry,1994,24:5-16.
[14]Grabot B,Geneste L.Dispatching Rules in Scheduling:a Fuzzy Approach.Int.J.Prod.Res.1994,32(4):903-915.
[15]Brun A,eortioli A.Agent-based shop-floor scheduling of multi stage systems.Computers and Industrial Engineering.1998,37(1):457-560.
[16]Abdallah M H.A knowledge-based simulation model for job shop scheduling.International Journal of Operations & Production Management.1995,15(10):89-102.
[17]玄光男,程润伟.遗传算法与工程优化.北京:清华大学出版社,2004.
[18]Kreipl S,Pinedo M.Planning and Scheduling in Supply Chains:An Overview of Issues in Practice.PRODUCITON AND OPERATIONS MANAGEMENT.2004,13(1):77-92.
[19]V Daniel R Guide Jr,Gilvan C Souza,Erwin van der Laan.Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly. European Journal of Operational Research 164(2005) 341-353.
[20]Merkle D,M iddendorf M.A new approach to solve permutation scheduling problems with ant colony optimization//Boers E JW,et al.Lecture Notes in Computer Science,LNCS 2037.Springer Berlin/Heidelberg,2001:484-494.
[21]BAPTISTE,P.LE PAPE,C,NUIJTEN,W.Constraint-Based Scheduling-Applying Constraint Programming to Scheduling Problems.Kluwer Academic Publishers,2001.
[22]Jackson,Sarah,Wilson J R,MacCarthy B L.A new model of scheduling in manufacturing:tasks,roles,and monitoring.(Manufacturing,Process Control Systems).Human Factors.2004,46(3):533-550.
[23]Crawford,S,Wiers V C S.From anecdotes to theory:Reviewing the knowledge of the human factors in planning and scheduling.In B.L.MacCarthy & J.R.Wilson(Eds.),Human performance in planning and scheduling(pp.15-44).London:Taylor & Francis,2001.
[24]Lee Y H,Jeong C S,Moon C.Advanced planning and scheduling with outsourcing in manufacturing supply chain,Computers and Industrial Engineering,43(1-2):351-3741,2002.
[25]Eck M,Advanced Planning and Scheduling:Is logistic everything? A research on the use(fullness) of advanced planning and scheduling systems,Technique report,Vrije University,Amsterdam,Holland,2003.
[26]I2 Technologies(2003),http://www.i2.com
[27]Manugistics(2003),http://www.manugistics.com
[28]王万良.生产调度智能算法及其应用.北京:科学出版社2007.
[29]王凌.车间调度及其遗传算法.北京:清华大学出版社,2003.
[30]唐国春,张峰,罗守成,刘丽丽著.现代排序论.上海:上海科学普及出版社,2003
[31]卢虎生,朱林,高学东.多智能体计划调度系统的理论与应用.冶金工业出版社,2003.12
[32]Florian M,Trepant P,Mcmahon G B.An implicit enumeration algorithm for the machine scheduling problem.Management Science.1971,(17):182-792.
[33]Carlier J,Pinson E.An algorithmfor solving the job-shop problem.Management Science,1989,35(2):164-176.
[34]J.Adams,E.Balas and D.Zawack.The Shifting Bottleneck Procedure for Job Shop Scheduling.Management Science,1988,34(3):391-401.
[35]Kiran A S,Smith M L.Simulation studies in Job shop scheduling-I a survey.Computer and Industry Enginieering,1984,8(2):87-93
[36]Fred Glover.Tabu Search-Part Ⅰ.Orsa Journal on Computing,1989,1(3):190-206.
[37]Metropolis N,Rosenbluth A,Rosenbluth M,et al.Equation of state calculations by fast computing machines.Journal of Chemical Physics,1953,21:1087-1092.
[38]Kirkpatrick S,Gelatt C D J,Yecchi M P.Optimization by Simulated Annealing.Science,1983,220:671-689.
[39]Gershwin S B,Hildebrant R,Suri R,et al.A Control Theorist's Perspective on Recent Trends in Manufacturing Systems.In Proceedings of the 23rd IEEE Conference on Decision and Control,Las Vegas,Nevada,(Invited) December,1984,pp.209-225.
[40]吴勃,刘胜辉.CIM环境下MRP与CPM一体化系统.机电产品开发与创新,2003,(1):38-40.
[41]Ronen,B.The complete kit concept.International Journal of Production Research,Vol.30 No.10,1992,pp.2457-66.
[42]Ronen,Boaz.Complete kit:Modeling the managerial approach.Computers & Industrial Engineering,1998,34(3):695-701.
[43]Leshno,M.,Ronen,B.The complete kit concept-Implementation in the health care system source.Human Systems Management,2001,20(4):313-318.
[44]BOZER,Y.A.,and MCGINNIS L.F.,1992,Kitting versus line stocking:a conceptual framework and a descriptive model.International Journal of Production Economics,28,1-19.
[45]Heeremans,D,Gelders,L F.Multiple period repair kit problem with a job completion criterion:A case study.European Journal of Operational Research,1995,81(2):239-248.
[46]Chen J F,Wilhelm W E.kitting in multi-echelon,multi-product assembly systems with parts substitutable.International Journal of Production Research,1997,35(10):2871-2897.
[47]Wendell G G.ESSAYS ON PRODUCTION PLANNING AND CONTROL.(PhDDissertation),STANFORD UNIVERSITY,1998.2.
[48]黎小平,宁宣熙.基于架次管理的装配过程零件动态配套性算法.计算机集成制造系统,1999,5(4):66-71.
[49]Croci F,Perono M,Pozzetti A.PCB assembly scheduling through kit concept.Production Planning and Control,2000,11(2):141-152.
[50]Chen Ruey-Shun,Lu Kun-Yung,Yu Shien-Chiang,et al.A case study in the design of BTO/CTO shop floor control system.Information and Management,2003,41(1):25-37.
[51]Lars Medbo.Assembly work execution and materials kit functionality in parallel flow assembly systems.International Journal of Industrial Ergonomics,2003,31:263-281.
[52]张屹,大林.生产组织与物料配合.广东经济出版社,2003.
[53]张斌,于明,王晨,等.生产计划制定过程的分析及数学建模.工业工程与管理.2003,3:35-39.
[54]Choobineh F,Mohebbi E.Material planning for production kits under uncertainty.Production Planning and Control,2004,15(1):63-70.
[55]Ramachandran,Satheesh,Delen,Dursun.Performance analysis of a kitting process in stochastic assembly systems.Computers and operations Research,2005,32(3):449-463.
[56]王万雷.制造执行系统(MES)若干关键技术的研究:(博士学位论文).大连:大连理工大学,2005.
[57]孟永胜.装备制造业产品制造数据集成管理研究与应用:(博士学位论文).大连:大连理工大学,2005.
[58]徐建萍,郭钢.基于工艺流程的物料配送BOM模型.重庆大学学报(自然科学版),2005,28(6):19-21.
[59]周水银,陈荣秋.单机加权成套订单数遗传算法研究.系统工程.2005,23(5):22-24.
[60]薛冬娟.复杂装备制造企业物料集成管理技术研究.(博士学位论文).大连:大连理工大学,2007.
[61]Jain A S,Meeran S.Deterministic job-shop scheduling:Past,present and future.European Journal of Operational Research,1999,113:390-434.
[62]熊锐,吴澄.车间生产调度问题的技术现状与发展趋势.清华大学学报(自然科学版),1998,38(10):55-60.
[63]吴怡,刘民,吴澄.JSSP基本约束特点分析及调度算法.清华大学学报(自然科学版),2004,44(10):1380-1383.
[64]张超勇,饶运清,李培根,等.求解作业车间调度问题的一种改进遗传算法.计算机集成制造系统,2004,10(8):966-970.
[65]Beck J C.Solution-guided multi-point constructive search for job shop scheduling.Journal of Artificial Intelligence Research,2007,29:49-77.
[66]ChaoYong Zhang,et al.A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem.Computers & Operations Research,2007,34(11):3229-3242.
[67]张晓东,严洪森.多级车间生产计划和调度的集成优化.机械工程学报,2005,41(9):98-105.
[68]Min Liu,Jing-Hua Hao,Cheng Wu.A prediction based iterative decomposition algorithm for scheduling large-scale job shops.Mathematical and Computer Modelling.2008,(47):411-421.
[69]Mahdavinejad R A.Multiple Job Shop-Scheduling using Hybrid Heuristic Algorithm.INTERNATIONAL JOURNAL OF MATHEMATICAL,PHYSICAL AND ENGINEERINGSCIENCES.2008,1(1):53-58.
[70]Chiang,T-C,Fu L-C.Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times.European Journal of Operational Research(2008),doi:10.1016/j.ejor.2007.12.042.
[71]Shiue Y-R.Development of two-level decision tree-based real-time scheduling system under product mix variety environment.Robot Comput Integr Manuf(2008),doi:10.1016/j.rcim.2008.06.002.
[72]Allahverdi A,Ng C T,Cheng T C E,Kovalyov M Y.A survey of scheduling problems with setup times or costs.European Journal of Operational Research.2008,(187):985-1032.
[73]Tao Gong,Tuson A L.Forma Analysis of Particle Swarm Optimisation for Permutation Problems.Journal of Artificial Evolution and Applications.2008:1-16.doi:10.1155/2008/587309.
[74]Imen Essafia,Yazid Matib,Stephane Dauzere-Peresc.A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem.Computers & Operations Research.2008,(35):2599-2616.
[75]Heinz Groflin,Andreas Klinkert,Nguyen Pham Dinh.Feasible job insertions in the multi-processor-task job shop.European Journal of Operational Research.2008,(185):1308-1318.
[76]Zribi N,Kamel A E,Borne P.Minimizing the makespan for the MPM job-shop with availability constraints.Int.J.Production Economics.2008,(112):151-160.
[77]赵宁,吴超,宁汝新,等.面向配作的柔性生产线调度.机械工程学报,2005,41(7):181-185.
[78]XIE Zhiqiang,YE Guangjie,LIU Yong,et al.Study on Job Shop Scheduling with Many Function-Same Machines.In:Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation,Harbin,2007,8:1278-1282.
[79]Bukchin J,Dar-El E M,Rubinovitz J.Mixed model assembly line design in a make-to-order environment[J].Computers & Industrial Engineering,2002,41(4):405-421.
[80]Henry Schellhorn.A note on the first moment of makespan in an assembly shop.European Journal of Operational Research,2007,180:963-969.
[81]Advanced Kitting.http://www.findaccountingsoftware.com/software/application/2939.
[82]Global Kitting.http://www.globalkitting.com/partfolio.shtml.
[83]Golhar Damodar Y,Stamm C L.The just in time philosophy:a literature review.International J Prod Res.(1991) 29(4):657-676.
[84]E.M.Goldratt and J.Cox,The Goal-the Process of Ongoing Improvement,2nd revision addition,The North River Press Publication,1992.
[85]万树良.国企生产管理模式的超越.湖南经济.2003,(05):38-39.
[86]陈国华,杨勇.关于我国制造企业生产管理模式更新的研究.企业活力.2006,(30):86-87.
[87]Pinedo M L.Planning and Scheduling in Manufacturing and Services.Series:Springer Series in Operations Research and Financial Engineering,2005.
[88]Thiagarajan S,Rajendran C.Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness,weighted tardiness and weighted flowtime of jobs.Computers & Industrial Engineering,Vol 49,Issue 4,pp.463-503,2005.
[89]苏平,于兆勤.基于混合遗传算法的混合装配线排序问题研究.计算机集成制造系统,2008,14(5):1002-1007.
[90]Fong-Yuen Ding,Jin Zhu,Hui Sun.Comparing two weighted approaches for sequencing mixed-model assembly lines with multiple objectives.Int.J.Production Economics,2006,102:108-131.
[91]曾洪鑫,宾鸿赞,张芬.多品种装配顺序的一种改进遗传算法.华中科技大学学报(自然科学版),2006,34(3):39-41.
[92]吴锋,刘文煌.手工装配作业下的一种调度策略与控制方法.清华大学学报(自然科学版),1998,38(2):58-61.
[93]王峻峰,李世其,刘继红,钟毅芳.计算机辅助装配规划研究综述.工程图学学 报,2005,(2):1-7.
[94]Gordon V,Proth J,Chu C.A survey of the state-of-the-art of common due date assignment and scheduling research.European Journal of Operational Research,2002,139(1):1-25.
[95]Adam N R,Bertrand J W M,Surkis J.Priority assignment procedures in multi-level assembly jobshops,IIE Transactions,vol.19,pp.317-329,1987.
[98]Fry TD,Oliff MD,Minor ED,Leong GK.The effects of product structure and sequencing rule on assembly shop performance,Int J Prod Res,vol.27,pp,671-686,1989.
[97]Philipoom P R,Russell R S,Fry T D.A preliminary investigation of multi-attribute based sequencing rules for assembly shops,International Journal of Production Research,vol.29,pp.739-753,1991.
[98]Doctor,S.R,Cavalier,T.M.and Egbelu,P.J.,Scheduling for machining and assembly in a job-shop environment.Int.J.Prod.Res.,1993,31,1275-1297.
[99]Cummings McKoy D H,Egbelu P J.Minimizing production flow time in a process and assembly job shop.Int.J.Prod.Res.,1998,36(8):2315-2332.
[100]熊禾根,李建军,孔健益,等.考虑工序相关性的Job shop调度问题启发式算法.机械工程学报,2006,42(8):50-55.
[101]Christian Hicks,Pupong Pongcharoen.Dispatching rules for production scheduling in the capital goods industry.Int.J.Production Economics,vol.104,pp.154-163,2006.
[102]Natarajan K,Mohanasundaram K M,Shoban Babu B,et al.Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness.Int J Adv Manuf Technol,2007,31:751-761.
[103]乔佩利,谢志强.基于关键设备工序紧凑的工序分类、分批的Job-Shop调度算法.机械工程学报,2004,40(8):17-21.
[104]谢志强,杨静,杨光等.可动态生成具有优先级工序集的动态Job-Shop调度算法.计算机学报,2008,31(3):502-508.
[105]谢志强,莫涛,谭光宇.非紧密衔接工序动态车间调度算法.机械工程学报,2008,44(1):156-160.
[106]Cheng T C E.Optimal due-date assignment in an assembly shop.International journal of operations & production management,1994,14(2):31-42.
[107]Song,D.P.,Hicks,C.,Earl,C.F.,"Product due date assignment for complex assemblies".International Journal of Production Economics,Vol.76,no.3,pp.243-256,2002.
[108]Sang Hum Yoon and Chang Sup Sung.Fixed pre-assembly scheduling on multiple fabrication machines.International Journal of Production Economics,vol.96,issue 1,pages 109-118,2005.
[109]Masao Yokoyana,Daryl L.Santos.Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times.European Journal of Operational Research,2005,161:754-770.
[110]Masao Yokoyama.Scheduling for two-stage production system with setup and assembly operations.Computers & Operations Research,2004,31:2063-2078.
[111]Amir A.,Hideki K.,Kosuke K.,et al.Modelling complex assemblies as a queueing network for lead time control.European Journal of Operational Research,2006,174:150-168.
[112]Kejia Chen and Ping Ji.A mixed integer programming model for advanced planning and scheduling(APS).European Journal of Operational Research,2007,181(1):515-522.
[113]Liu Jianguo,Zhang Xiaofeng,Wang Ningsheng.MANUFACTURING SYSTEM SCHEDUL ING BASED ON MULTI-AGENT COOPERATION GAME.Transactions of Nanjing University of Aeronautics &Astronautics 2007,24(4):329-334.
[114]刘建国,李青松,王宁生.柔性制造系统的合作博弈调度.华南理工大学学报(自然科学版),2007,35(9):101-106.
[115]Kim JU,Kim YD.Simulated annealing and genetic algorithms for scheduling products with multi-level product structure.Comput Oper Res,1996,23(9):857-868.
[116]Chan FTS,et al.Lot streaming for product assembly in job shop environment.Robot Comput Integr Manuf(2007),doi:10.1016/j.rcim.2007.01.001.
[117]Pongcharoen P,Hicks C,Braiden P M,Stewardson D J.Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products.International Journal of Production Economics,Vol.78,pp.311-322,2002.
[118]Pongcharoen P,Hicks C,Braiden P M.The development of genetic algorithms for the finite capacity scheduling of complex products,with multiple levels of product structure.European Journal of Operational Research,2004,152(1):215-225.
[119]ZX Guo,WK Wong,SYS Leung,et al.Mathematical model and genetic optimization for the job shop scheduling problem in a mixed-and multi-product assembly environment:A case study based on the apparel industry.Computers and Industrial Engineering,2006,50:202-219.
[120]G.Vilcot,J.-C.Billaut,A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem,European Journal of Operational Research(2007),doi:10.1016/j.ejor.2007.06.039.
[121]尹文君,刘民,吴澄.进化计算在生产线调度研究中的现状与展望.计算机集成制造系统-CIMS,2001,7(12):1-6.
[122]Metaxiotis K S,Psarras J E,Askounis D.Building ontologies for production scheduling systems:towards a unified methodology.Information Management & Computer Security.2001,9(1):44-50.
[123]Bagley J D.The Behavior of Adaptive system which Employ Genetic and Correlation Algorithm:(PhD Dissertation).University of Michigan,1967.
[124]Goldberg D E.Genetic Algorithm in Search,Optimization and Machine Learning.Addision-Wesley,1989.
[125]Cheng R,Gen M,Tsujimura Y.A tutorial survey of jobshop scheduling problems using genetic algorithms,part Ⅰ:representation.Computers & Industrial Engineering,1996,30(4):983-997.
[126]Tsujimura Y,Gen M,Cheng R,Momota T.Comparative studies on encoding methods of GA for open shop scheduling.Australian Journal of Intelligent Information Processing Systems,Vol.4,no.3-4,pp.214-219,1997.
[127]Pinedo,M L.Scheduling:Theory,Algorithms,and Systems,2nd ed.,2002,Prentice Hall.
[128]Coello C A C.Theoretical and numerical constraint-handling techniques used with evolutionary algorithms:a survey of the state of the art.Comput.Methods Appl Mech Engrg,2002,191:1245-1287.
[129]Goldberg D E,Deb K,Korb B.Messy genetic algorithms revisited:studies in mixed size and scale.Complex Systems,1990,4,415-444.
[130]Michalewicz Z.A survey of constraint handling techniques in evolutionary computation methods,in:J.R.McDonnell,R.G.Reynolds,D.B.Fogel(Eds.),Proceedings of the Fourth Annual Conference on Evolutionary Programming,MIT Press,Cambridge,MA,1995,pp.135-155.
[131]高玉根,程峰,王灿,等.基于违约解转化法的遗传算法及其性能分析.电子学报,2006,4:638-641.
[132]郭冬芬,李铁克.基于约束满足的车间调度算法综述.计算机集成制造系统,2007年,13(1):117-125.
[133]杨晓梅,曾建潮.采用多个体交叉的遗传算法求解作业车间问题.计算机集成制造系统,2004,10(9):1114-1119.
[134]王超.基于遗传算法的产品装配生产调度优化研究:(硕士学位论文).武汉:武汉大学,2005.
[135]高永超.智能优化算法的性能及搜索空间研究:(博士学位论文).山东:山东大学,2007.
[136]Guoyong SHI,Hitoshi IIMA,Nobuo SANNOMIYA.A New Encoding Scheme for Solving Job Shop Problems by Genetic Algorithm.Proceedings of the 35th Conference on Decision and Control,Kobe,Japan December 1996:4395-4400.
[137]上官春霞,周泓,师瑞峰等.求解作业排序问题的一种改进修复约束满足算法.控制与决策,2008,23(8):850-856.
[138]王波,张群,王飞等.Job Shop排序问题解空间定量分析.控制与决策,2001,16(1):33-36.
[139]谢胜利,黄强,董金祥.求解JSP的遗传算法中不可行调度的方案.计算机集成制造系统,2002,8(11):903-906.
[140]Liepins,G.E.and W.D.Potter.A Genetic Algorithm Approach to Multiple-Fault Diagnosis.In Davis(ed.),Handbook of Genetic Algorithms,Van Nostrand Reinhold.1991.
[141]ORVOSH D,DAVIS L.Using a genetic algorithm to optimize problems with feasibility constraints.Proceedings of the First IEEE Conference on Evolutionary Computation. New York,WA,USA:IEEE Service Center.1994.548-553.
[142]Coello C A C,Efren Mezura Montes.Constraint-Handling in Genetic Algorithms Through the Use of Dominance-based Tournament Selection.Advanced Engineering Informatics.2002,16(3):193-203.
[143]孙志峻.智能制造系统车间生产优化调度:(博士学位论文).南京:南京航空航天大学,2002.
[144]郑欣,杨丽徙,谢志棠.配电网络重构的改进混合遗传算法.继电器,2004,32(5):11-14.
[145]Ozgur Yeniay.PENALTY FUNCTION METHODS FOR CONSTRAINED OPTIMIZATION WITH GENETIC ALGORITHMS.Mathematical and Computational Applications,2005,Vol.10,No.1,pp.45-56.
[146]王凌,何锲,金以慧.智能约束处理技术综述.化工自动化及仪表,2008,35(1):1-7.
[147]Linping Wang,Zhenyuan Jia,Fuji Wang.Solving Complete Job Shop Scheduling Problem Using Genetic Algorithm,Proceeding of The 7-th World Congress on Intelligent Control and Automation,Chongqing,P.R.China,June 25-27,2008.
[148]Brooming T R.Applying the Design Structure Matrix to System Decomposition and Integration Problems:A Review and New Directions,IEEE Transactions on Engineering Management,48(3)(2001) 292-306.
[149]Sharman D M,Yassine A A.Characterizing Complex Product Architectures.Systems Engineering,2004,7(1):35-69.
[150]Donis Marshall著,许华杰,刘光惠译.Visual C#2005技术内幕.北京:清华大学出版,2007:5-18.
[151]Bierwirth C,Mattfeld D C,Kopfer H.On permutation representations for scheduling problems//Lecture Notes in Computer Science,Springer Berlin/Heidelberg,1996,Vol.1141,Parallel Problem Solving from Nature—PPSN Ⅳ.
[152]Wiese K,Goodwin S D,Nagarajan S.ASERC-A Genetic Sequencing Operator for Asymmetric Permutation Problems//Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence:Advances in Artificial Intelligence,London,UK:Springer-Verlag,2000,1822:201-213.
[153]MASATO WATANABE,KENICHI IDA,MITSUO GEN.Active Solution Space and Search on Job-Shop Scheduling Problem.Electrical Engineering in Japan,2006,154(4):61-67.
[154]阮吉寿,张华.信息论基础(译),北京:机械工业出版社,2008.1.
[155]Cheng R,Gen M,Tsujimura Y.A tutorial survey of job shop scheduling problems using genetic algorithms,part Ⅱ:hybrid genetic search strategies.Computers and Industrial Engineering,1999,36:343-364.
[156]王健,王建华.标准遗传算法的研究进展[J].华东船舶工业学院学报,2000,14(3):28-35.
[157]王秀娟.正交均匀设计在遗传算法初始编码中的应用.潍坊学院学报,2007,7(6):108-110.
[158]李志俊,程家兴.基于数论佳点集的遗传算法初始种群均匀设计.电脑与信息技术,2007,15(4):29-32.
[159]何大阔,王福利,贾明兴.遗传算法初始种群与操作参数的均匀设计.东北大学学报(自然科学版),2005,26(9):828-831.
[160]胡建军,唐常杰,段磊,等.基因表达式编程初始种群的多样化策略.计算机学报,2007,30(2):305-310.
[161]杜宏伟,潘志国,林悦香,等.遗传算法解决车间作业调度问题的优化研究.组合机床与自动化加工技术,2007,(5):109-112.
[162]谢志强,刘胜辉,乔佩利.电机产品加工的动态调度算法.计算机集成制造系统,2003,9(6):444-448.
[163]谢志强,刘胜辉,乔佩利.基于ACPM和BFSM的动态Job-Shop调度算法.计算机研究与发展,2003,40(7):79-85.
[164]唐国春.2003年到2005年排序(调度)学科在中国的发展(Ⅰ).上海第二工业大学学报,2006,23(3):167-176.
[165]季敏.当代工业中的若干排序问题研究:(博士学位论文).杭州:浙江大学,2006.3.
[166]吴秀丽.多目标柔性Job Shop调度问题的技术现状和发展趋势.计算机应用研究,2007,24(3):1-5.
[167]Murata T,Ishibuchi H,Lee K H.Reformulation of Various Non-Fuzzy Scheduling Problem s Using the Concept of Fuzzy Due-Date.Proceedings of 6th IEEE International Conference on Fuzzy System s,1997:447-452.
[168]Murata T,GenM,Ish ibuch iH.Multi-Objective Scheduling with Fuzzy Due-Date.Computers ind Engng,1998,35(3-4):439-442.
[169]Murata T,O sh ida H,JenM.Rule-Based Weight Definition Form Objective Fuzzy Scheduling with the OWA Operator.The Proceedings of 26th Annual Conference of the IEEE on Industrial Electronics Society,2000,4:2756-2761.
[170]Masato shi S,Ryo K.Fuzzy Programming for Multi-Objective Job Shop Scheduling with Fuzzy Processing Time and Fuzzy Duedate through Genetic Algorithms.European Journal of Operational Research,2000,120(2):393-407.
[171]Baker K R,SMITH J C.A MULTIPLE-CRITERION MODEL FOR MACHINE SCHEDULING.Journal of Scheduling.2003,(6):7-16.
[172]Li F,Zhu Y,Yin C.Fuzzy Programming for Multiobjective Fuzzy Job Shop Scheduling with Alternative Machines through Genetic Algorithm s.The Proceedings of 2005International Conference on Natural Computation,2005,992-1004.
[173]吴秀丽,孙树栋,杨展,等.面向工件的多目标柔性Job Shop调度问题研究.西北工业大学学报,2006,24(4):477-481.
[174]谭芳,孙世杰.宽容交货加权超前延误单机排序问题.上海大学学报(自然科学版),2005,11(2):149-154.
[175]刘朝晖,俞文.成组加工的单机延误工件个数问题.华东理工大学学报.1998,24(2):235-242.
[176]Zhi-Long Chen,Guruprasad Pundoor.Order Assignment and Scheduling in a Supply Chain.OPERATIONS RESEARCH,2006,54(3):555-572.
[177]IRAVANI S M R,LUANGKESORN K L,SIMCHI-LEVI D.On assemble-to-order systems with flexible customers,IIE,2003,35:389-403.
[178]CHENG T C E,KANG Li-ying,NG C T.Due-date assignment and single machine scheduling with deteriorating jobs.Journal of the Operational Research Society,2004,55:198-203.
[179]CHENG T C E,KANG Li-ying,NG C T.Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.International Transactions in Operational Research,2005,12:335-366.
[180]Lin Shih-Wei,Chou Shuo-Yan,Chen Shih-Chieh.Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date.Journal of Heuristics.2007,13:151-165.
[181]Julien FM,Magazine MJ(1990) Scheduling customer orders:an alternative production scheduling approach.J Manuf Oper Man 3:177-199.
[182]司昕,郑应平,安燮南.具有多种工件类型的最小订单延期数问题.自动化学报,2000,26(6):845-847.
[183]王书峰,刘海成.混合整数规划的约束规划在订单排产中的应用.郑州大学学报(工学版)2002,23(2):13-15.
[184]刘静,孙世杰,陈跃.订单带多工类工件的极小迟后范围问题.运筹学学报,2006,10(3):91-98.
[185]Erel E,Ghosh JB(2007) Customer order scheduling on a single machine with family setup times:complexity and algorithms.App Math Comput 185:11-18.
[186]Oncu Hazir,Yavuz Gunalay,Erdal Erel.Customer order scheduling problem:a comparative metaheuristics study.Int J Adv Manuf Technol.2008,37:589-598.
[187]JAEHWAN YANG,POSNER M E.SCHEDULING PARALLEL MACHINES FOR THE CUSTOMER ORDER PROBLEM.Journal of Scheduling.2005,8:49-74.
[188]Ahmadi R,Bagchi U,Roemer T A.Coordinated Scheduling of Customer Orders for Quick Response.Naval Research Logistics.2005,52:493-512.
[189]Leung J Y-T,Haibing Li,Pinedo M.ORDER SCHEDULING MODELS:AN OVERVIEW.In Multidisciplinary Scheduling:Theory and Applications.Springer US,2005.
[190]JosephY-T,Leunga,Haibing Lia,Michael Pinedo.Scheduling orders for multiple product types to minimize total weighted completion time.Discrete Applied Mathematics.2007,155:945-970.
[191]Blocher J D,Chhajed D,Leung M.Customer Order Scheduling in a General Job Shop Environment.Decision Sciences.1998,29(4):951-981.
[192]李浩,沈祖志,邓明荣.订货型企业基于约束理论的订单排产优化研究.中国机械工程.2004,15(10):865-869.
[193]Guo Z X,Wong W K,Leung S Y S,et al.Genetic optimization of order scheduling with multiple uncertainties,Expert Systems with Applications(2007),doi:10.1016/j.eswa.2007.08.058.
[194]周水银,盛培锋.一种单机加权成套订单数问题的遗传算法.工业工程与管理.2006,(6):75-79.
[195]吴春辉,周水银.并行多机加权成套订单数极大化的混合遗传算法.系统工程理论与实践.2006,(11):125-129.
[196]周水银,盛培锋.面向成套订单问题的工艺规划与排序的集成研究.中国管理科学.2006,14(5):73-80.
[197]苏亚.单机带调整时间加权成套订单数问题遗传算法研究.工业工程,2007,10(3):119-122.
[198]苏亚,傅青.并行机含调整时间成套订单数问题遗传算法.控制工程,2007,14(1):78-81.
[199]周水银,傅青.最大化流水作业加权成套订单数的研究.控制工程,2007,14(2):212-214.
[200](日)木村博光著.刘蔚三,李坤堂译.如何实施正确的生产管理.北京:北京大学出版社,2004.
[201]蔡良伟,胡世曦.基于相似性遗传算法及其在JSP中的应用.深圳大学学报(理工版).2006,23(2):107-111.
[202]陈世哲,刘国栋,浦欣,浦昭邦,胡涛,刘宛予.基于优势遗传的自适应遗传算法.哈尔滨工业大学学报,2007,39(7):1021-1024.
[203]张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题.中国机械工程.2004,15(23):2149-2153.
[204]李怀祖.生产计划与控制(修订版).北京:中国科学技术出版社,2005.4.
[205]何霆,刘飞,马玉林.车间生产调度问题研究.机械工程学报,2002,36(5):97-102.
[206]唐国春.2003年到2005年排序(调度)学科在中国的发展(Ⅱ).上海第二工业大学学报,2006,23(4):261-271.
[207]金锋,吴澄.大规模生产调度问题的研究现状与展望.计算机集成制造系统,2006,12(2):161-168.
[208]李娟,刘旭.精益化装配管理.中国计量出版社,2006.
[209]张居阳,孙吉贵.组合优化调度问题求解方法.计算机科学,2003,30(2):9-16.
[210]徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述.计算机研究与发展,2004,41(2):257-267.
[211]朱剑英.智能系统非经典数学方法.武汉:华中科技大学出版社,2001.
[212]陈宗舜.制造业信息化与信息编码.北京:清华大学出版社,2004.
[213]李培根.制造系统性能分析建模.武汉:华中理工大学出版社,1998.
[214]陈红.如何进行生产作业管理.北京大学出版社.2004.1
[215]邢文训,谢金星.现代优化计算方法.北京:清华大学出版社,2005.9(第二版).
[216]陈宗舜.制造业信息化与信息编码.北京:清华大学出版社,2004.
[217]阿惟.Visual Basic.NET进销存程序设计.北京:清华大学出版社,2003.7.
[218](美)哈尔弗森著.Visual Basic.NET程序设计.北京:清华大学出版社,2002.
[219]赵增敏,朱粹丹.SQL Server 2000实用教程.北京:电子工业出版社,2002.
[220](美)Dejan Sunderic.SQL Server 2000存储过程与XML编程.北京:清华大学出版社,2003.
[221]王庆育.软件工程.北京:清华大学出版社,2004.7.
[222]Deitel H M,Deitel P J,Listfield J A,et al.C# for experienced programmers.Beijing:Pub.House of Electronics Industry,2003.
[223]James Foxall著,陈秋萍译.VisualC#2005入门经典.北京:人民邮电出版社,2007.
[224]Ben Albahari.C# Essentials.Publisher:O'Reilly,2001.
[225]李芳芸,柴跃廷.CIMS环境下集成化管理信息系统的分析、设计与实施.北京:清华大学出版社,1996.
[226]刘飞,杨丹,王时龙.CIMS制造自动化.北京:机械工业出版社,1997.
[227]陈启申.ERP-从内部集成起步.北京:电子工业出版社,2004.
[228]Tony Arnold J R.Introduction to Materials Management,second edition,PRENTICE HALL,1996.
[229]戴勇.数字化制造过程数字化管理.北京:科学出版社,2004.
[230]陈红.如何进行生产作业管理.北京:北京大学出版社2004.
[231]Vollmann T E,Berry W L,Whybark D C.Manufacturing planning and control systems.Fourth edition,Irwin/McGraw-Hill,1997.
[232]Jay neizer,Barry Render.PRINCIPLES OF OPERATIONS MANAGEMENT,Sixth edition,Prenhall,2006.
[2]李随成,吴生祥,董正辉.多品种小批量生产技术与组织管理的发展动向.西安工业学院学报,1997,17(3):242-247.
[3]Johnson S M.Optimal two-and three-stage production scheduling with set-up times included.Navel Research Logistics Quarterly.1954,1:64-68.
[4]Mellor.A Review of Job Shop Scheduling.Operational Research Quarterly.1966,17(2):161-171.
[5]Conway R W,Maxweland W L,Miller L W.Theory of scheduling.Reading Mass:Addison-Wesley,1967.
[6]Garey M R,Johnson D S,Ravi Sethi.The complexity of flowshop and jobshop scheduling.Mathematics of Operations Research,1976,1(2):117-129.
[7]Panwalkar S S,Iskander W.A survey of scheduling rules.Operations Research,1977,25(1):45-61.
[8]Baker K R.Introduction to sequencing and scheduling,Wiley,New York,1974.
[9]Stenphen,Graves C.A Review of Production Scheduling.Ops.Res.,1981,29(4):646-675.
[10]Rodammer F A,White K e.A recent survey of production scheduling.IEEE Trans on Systems Man and Cybernetics,1988,18(6):841-851.
[11]Groce F D,Tadei R,Volta G.A genetic algorithm for the job shop problem.Computers and Operations Research,1995,22(1):15-24.
[12]Foo Y S,Takefuji Y.Stochastic neural networks for solving job-shop scheduling:part1.Problem representation,Stochastic neural networks for solving job-shop scheduling:Part2.Architecture and simulations.In:IEEE Int Conf on NNS,San Diego,1998.
[13]D' Souza K A,Khator S K.A survey of Petri net applications in modeling controls for automated manufacturing systems.Computers in Industry,1994,24:5-16.
[14]Grabot B,Geneste L.Dispatching Rules in Scheduling:a Fuzzy Approach.Int.J.Prod.Res.1994,32(4):903-915.
[15]Brun A,eortioli A.Agent-based shop-floor scheduling of multi stage systems.Computers and Industrial Engineering.1998,37(1):457-560.
[16]Abdallah M H.A knowledge-based simulation model for job shop scheduling.International Journal of Operations & Production Management.1995,15(10):89-102.
[17]玄光男,程润伟.遗传算法与工程优化.北京:清华大学出版社,2004.
[18]Kreipl S,Pinedo M.Planning and Scheduling in Supply Chains:An Overview of Issues in Practice.PRODUCITON AND OPERATIONS MANAGEMENT.2004,13(1):77-92.
[19]V Daniel R Guide Jr,Gilvan C Souza,Erwin van der Laan.Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly. European Journal of Operational Research 164(2005) 341-353.
[20]Merkle D,M iddendorf M.A new approach to solve permutation scheduling problems with ant colony optimization//Boers E JW,et al.Lecture Notes in Computer Science,LNCS 2037.Springer Berlin/Heidelberg,2001:484-494.
[21]BAPTISTE,P.LE PAPE,C,NUIJTEN,W.Constraint-Based Scheduling-Applying Constraint Programming to Scheduling Problems.Kluwer Academic Publishers,2001.
[22]Jackson,Sarah,Wilson J R,MacCarthy B L.A new model of scheduling in manufacturing:tasks,roles,and monitoring.(Manufacturing,Process Control Systems).Human Factors.2004,46(3):533-550.
[23]Crawford,S,Wiers V C S.From anecdotes to theory:Reviewing the knowledge of the human factors in planning and scheduling.In B.L.MacCarthy & J.R.Wilson(Eds.),Human performance in planning and scheduling(pp.15-44).London:Taylor & Francis,2001.
[24]Lee Y H,Jeong C S,Moon C.Advanced planning and scheduling with outsourcing in manufacturing supply chain,Computers and Industrial Engineering,43(1-2):351-3741,2002.
[25]Eck M,Advanced Planning and Scheduling:Is logistic everything? A research on the use(fullness) of advanced planning and scheduling systems,Technique report,Vrije University,Amsterdam,Holland,2003.
[26]I2 Technologies(2003),http://www.i2.com
[27]Manugistics(2003),http://www.manugistics.com
[28]王万良.生产调度智能算法及其应用.北京:科学出版社2007.
[29]王凌.车间调度及其遗传算法.北京:清华大学出版社,2003.
[30]唐国春,张峰,罗守成,刘丽丽著.现代排序论.上海:上海科学普及出版社,2003
[31]卢虎生,朱林,高学东.多智能体计划调度系统的理论与应用.冶金工业出版社,2003.12
[32]Florian M,Trepant P,Mcmahon G B.An implicit enumeration algorithm for the machine scheduling problem.Management Science.1971,(17):182-792.
[33]Carlier J,Pinson E.An algorithmfor solving the job-shop problem.Management Science,1989,35(2):164-176.
[34]J.Adams,E.Balas and D.Zawack.The Shifting Bottleneck Procedure for Job Shop Scheduling.Management Science,1988,34(3):391-401.
[35]Kiran A S,Smith M L.Simulation studies in Job shop scheduling-I a survey.Computer and Industry Enginieering,1984,8(2):87-93
[36]Fred Glover.Tabu Search-Part Ⅰ.Orsa Journal on Computing,1989,1(3):190-206.
[37]Metropolis N,Rosenbluth A,Rosenbluth M,et al.Equation of state calculations by fast computing machines.Journal of Chemical Physics,1953,21:1087-1092.
[38]Kirkpatrick S,Gelatt C D J,Yecchi M P.Optimization by Simulated Annealing.Science,1983,220:671-689.
[39]Gershwin S B,Hildebrant R,Suri R,et al.A Control Theorist's Perspective on Recent Trends in Manufacturing Systems.In Proceedings of the 23rd IEEE Conference on Decision and Control,Las Vegas,Nevada,(Invited) December,1984,pp.209-225.
[40]吴勃,刘胜辉.CIM环境下MRP与CPM一体化系统.机电产品开发与创新,2003,(1):38-40.
[41]Ronen,B.The complete kit concept.International Journal of Production Research,Vol.30 No.10,1992,pp.2457-66.
[42]Ronen,Boaz.Complete kit:Modeling the managerial approach.Computers & Industrial Engineering,1998,34(3):695-701.
[43]Leshno,M.,Ronen,B.The complete kit concept-Implementation in the health care system source.Human Systems Management,2001,20(4):313-318.
[44]BOZER,Y.A.,and MCGINNIS L.F.,1992,Kitting versus line stocking:a conceptual framework and a descriptive model.International Journal of Production Economics,28,1-19.
[45]Heeremans,D,Gelders,L F.Multiple period repair kit problem with a job completion criterion:A case study.European Journal of Operational Research,1995,81(2):239-248.
[46]Chen J F,Wilhelm W E.kitting in multi-echelon,multi-product assembly systems with parts substitutable.International Journal of Production Research,1997,35(10):2871-2897.
[47]Wendell G G.ESSAYS ON PRODUCTION PLANNING AND CONTROL.(PhDDissertation),STANFORD UNIVERSITY,1998.2.
[48]黎小平,宁宣熙.基于架次管理的装配过程零件动态配套性算法.计算机集成制造系统,1999,5(4):66-71.
[49]Croci F,Perono M,Pozzetti A.PCB assembly scheduling through kit concept.Production Planning and Control,2000,11(2):141-152.
[50]Chen Ruey-Shun,Lu Kun-Yung,Yu Shien-Chiang,et al.A case study in the design of BTO/CTO shop floor control system.Information and Management,2003,41(1):25-37.
[51]Lars Medbo.Assembly work execution and materials kit functionality in parallel flow assembly systems.International Journal of Industrial Ergonomics,2003,31:263-281.
[52]张屹,大林.生产组织与物料配合.广东经济出版社,2003.
[53]张斌,于明,王晨,等.生产计划制定过程的分析及数学建模.工业工程与管理.2003,3:35-39.
[54]Choobineh F,Mohebbi E.Material planning for production kits under uncertainty.Production Planning and Control,2004,15(1):63-70.
[55]Ramachandran,Satheesh,Delen,Dursun.Performance analysis of a kitting process in stochastic assembly systems.Computers and operations Research,2005,32(3):449-463.
[56]王万雷.制造执行系统(MES)若干关键技术的研究:(博士学位论文).大连:大连理工大学,2005.
[57]孟永胜.装备制造业产品制造数据集成管理研究与应用:(博士学位论文).大连:大连理工大学,2005.
[58]徐建萍,郭钢.基于工艺流程的物料配送BOM模型.重庆大学学报(自然科学版),2005,28(6):19-21.
[59]周水银,陈荣秋.单机加权成套订单数遗传算法研究.系统工程.2005,23(5):22-24.
[60]薛冬娟.复杂装备制造企业物料集成管理技术研究.(博士学位论文).大连:大连理工大学,2007.
[61]Jain A S,Meeran S.Deterministic job-shop scheduling:Past,present and future.European Journal of Operational Research,1999,113:390-434.
[62]熊锐,吴澄.车间生产调度问题的技术现状与发展趋势.清华大学学报(自然科学版),1998,38(10):55-60.
[63]吴怡,刘民,吴澄.JSSP基本约束特点分析及调度算法.清华大学学报(自然科学版),2004,44(10):1380-1383.
[64]张超勇,饶运清,李培根,等.求解作业车间调度问题的一种改进遗传算法.计算机集成制造系统,2004,10(8):966-970.
[65]Beck J C.Solution-guided multi-point constructive search for job shop scheduling.Journal of Artificial Intelligence Research,2007,29:49-77.
[66]ChaoYong Zhang,et al.A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem.Computers & Operations Research,2007,34(11):3229-3242.
[67]张晓东,严洪森.多级车间生产计划和调度的集成优化.机械工程学报,2005,41(9):98-105.
[68]Min Liu,Jing-Hua Hao,Cheng Wu.A prediction based iterative decomposition algorithm for scheduling large-scale job shops.Mathematical and Computer Modelling.2008,(47):411-421.
[69]Mahdavinejad R A.Multiple Job Shop-Scheduling using Hybrid Heuristic Algorithm.INTERNATIONAL JOURNAL OF MATHEMATICAL,PHYSICAL AND ENGINEERINGSCIENCES.2008,1(1):53-58.
[70]Chiang,T-C,Fu L-C.Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times.European Journal of Operational Research(2008),doi:10.1016/j.ejor.2007.12.042.
[71]Shiue Y-R.Development of two-level decision tree-based real-time scheduling system under product mix variety environment.Robot Comput Integr Manuf(2008),doi:10.1016/j.rcim.2008.06.002.
[72]Allahverdi A,Ng C T,Cheng T C E,Kovalyov M Y.A survey of scheduling problems with setup times or costs.European Journal of Operational Research.2008,(187):985-1032.
[73]Tao Gong,Tuson A L.Forma Analysis of Particle Swarm Optimisation for Permutation Problems.Journal of Artificial Evolution and Applications.2008:1-16.doi:10.1155/2008/587309.
[74]Imen Essafia,Yazid Matib,Stephane Dauzere-Peresc.A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem.Computers & Operations Research.2008,(35):2599-2616.
[75]Heinz Groflin,Andreas Klinkert,Nguyen Pham Dinh.Feasible job insertions in the multi-processor-task job shop.European Journal of Operational Research.2008,(185):1308-1318.
[76]Zribi N,Kamel A E,Borne P.Minimizing the makespan for the MPM job-shop with availability constraints.Int.J.Production Economics.2008,(112):151-160.
[77]赵宁,吴超,宁汝新,等.面向配作的柔性生产线调度.机械工程学报,2005,41(7):181-185.
[78]XIE Zhiqiang,YE Guangjie,LIU Yong,et al.Study on Job Shop Scheduling with Many Function-Same Machines.In:Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation,Harbin,2007,8:1278-1282.
[79]Bukchin J,Dar-El E M,Rubinovitz J.Mixed model assembly line design in a make-to-order environment[J].Computers & Industrial Engineering,2002,41(4):405-421.
[80]Henry Schellhorn.A note on the first moment of makespan in an assembly shop.European Journal of Operational Research,2007,180:963-969.
[81]Advanced Kitting.http://www.findaccountingsoftware.com/software/application/2939.
[82]Global Kitting.http://www.globalkitting.com/partfolio.shtml.
[83]Golhar Damodar Y,Stamm C L.The just in time philosophy:a literature review.International J Prod Res.(1991) 29(4):657-676.
[84]E.M.Goldratt and J.Cox,The Goal-the Process of Ongoing Improvement,2nd revision addition,The North River Press Publication,1992.
[85]万树良.国企生产管理模式的超越.湖南经济.2003,(05):38-39.
[86]陈国华,杨勇.关于我国制造企业生产管理模式更新的研究.企业活力.2006,(30):86-87.
[87]Pinedo M L.Planning and Scheduling in Manufacturing and Services.Series:Springer Series in Operations Research and Financial Engineering,2005.
[88]Thiagarajan S,Rajendran C.Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness,weighted tardiness and weighted flowtime of jobs.Computers & Industrial Engineering,Vol 49,Issue 4,pp.463-503,2005.
[89]苏平,于兆勤.基于混合遗传算法的混合装配线排序问题研究.计算机集成制造系统,2008,14(5):1002-1007.
[90]Fong-Yuen Ding,Jin Zhu,Hui Sun.Comparing two weighted approaches for sequencing mixed-model assembly lines with multiple objectives.Int.J.Production Economics,2006,102:108-131.
[91]曾洪鑫,宾鸿赞,张芬.多品种装配顺序的一种改进遗传算法.华中科技大学学报(自然科学版),2006,34(3):39-41.
[92]吴锋,刘文煌.手工装配作业下的一种调度策略与控制方法.清华大学学报(自然科学版),1998,38(2):58-61.
[93]王峻峰,李世其,刘继红,钟毅芳.计算机辅助装配规划研究综述.工程图学学 报,2005,(2):1-7.
[94]Gordon V,Proth J,Chu C.A survey of the state-of-the-art of common due date assignment and scheduling research.European Journal of Operational Research,2002,139(1):1-25.
[95]Adam N R,Bertrand J W M,Surkis J.Priority assignment procedures in multi-level assembly jobshops,IIE Transactions,vol.19,pp.317-329,1987.
[98]Fry TD,Oliff MD,Minor ED,Leong GK.The effects of product structure and sequencing rule on assembly shop performance,Int J Prod Res,vol.27,pp,671-686,1989.
[97]Philipoom P R,Russell R S,Fry T D.A preliminary investigation of multi-attribute based sequencing rules for assembly shops,International Journal of Production Research,vol.29,pp.739-753,1991.
[98]Doctor,S.R,Cavalier,T.M.and Egbelu,P.J.,Scheduling for machining and assembly in a job-shop environment.Int.J.Prod.Res.,1993,31,1275-1297.
[99]Cummings McKoy D H,Egbelu P J.Minimizing production flow time in a process and assembly job shop.Int.J.Prod.Res.,1998,36(8):2315-2332.
[100]熊禾根,李建军,孔健益,等.考虑工序相关性的Job shop调度问题启发式算法.机械工程学报,2006,42(8):50-55.
[101]Christian Hicks,Pupong Pongcharoen.Dispatching rules for production scheduling in the capital goods industry.Int.J.Production Economics,vol.104,pp.154-163,2006.
[102]Natarajan K,Mohanasundaram K M,Shoban Babu B,et al.Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness.Int J Adv Manuf Technol,2007,31:751-761.
[103]乔佩利,谢志强.基于关键设备工序紧凑的工序分类、分批的Job-Shop调度算法.机械工程学报,2004,40(8):17-21.
[104]谢志强,杨静,杨光等.可动态生成具有优先级工序集的动态Job-Shop调度算法.计算机学报,2008,31(3):502-508.
[105]谢志强,莫涛,谭光宇.非紧密衔接工序动态车间调度算法.机械工程学报,2008,44(1):156-160.
[106]Cheng T C E.Optimal due-date assignment in an assembly shop.International journal of operations & production management,1994,14(2):31-42.
[107]Song,D.P.,Hicks,C.,Earl,C.F.,"Product due date assignment for complex assemblies".International Journal of Production Economics,Vol.76,no.3,pp.243-256,2002.
[108]Sang Hum Yoon and Chang Sup Sung.Fixed pre-assembly scheduling on multiple fabrication machines.International Journal of Production Economics,vol.96,issue 1,pages 109-118,2005.
[109]Masao Yokoyana,Daryl L.Santos.Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times.European Journal of Operational Research,2005,161:754-770.
[110]Masao Yokoyama.Scheduling for two-stage production system with setup and assembly operations.Computers & Operations Research,2004,31:2063-2078.
[111]Amir A.,Hideki K.,Kosuke K.,et al.Modelling complex assemblies as a queueing network for lead time control.European Journal of Operational Research,2006,174:150-168.
[112]Kejia Chen and Ping Ji.A mixed integer programming model for advanced planning and scheduling(APS).European Journal of Operational Research,2007,181(1):515-522.
[113]Liu Jianguo,Zhang Xiaofeng,Wang Ningsheng.MANUFACTURING SYSTEM SCHEDUL ING BASED ON MULTI-AGENT COOPERATION GAME.Transactions of Nanjing University of Aeronautics &Astronautics 2007,24(4):329-334.
[114]刘建国,李青松,王宁生.柔性制造系统的合作博弈调度.华南理工大学学报(自然科学版),2007,35(9):101-106.
[115]Kim JU,Kim YD.Simulated annealing and genetic algorithms for scheduling products with multi-level product structure.Comput Oper Res,1996,23(9):857-868.
[116]Chan FTS,et al.Lot streaming for product assembly in job shop environment.Robot Comput Integr Manuf(2007),doi:10.1016/j.rcim.2007.01.001.
[117]Pongcharoen P,Hicks C,Braiden P M,Stewardson D J.Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products.International Journal of Production Economics,Vol.78,pp.311-322,2002.
[118]Pongcharoen P,Hicks C,Braiden P M.The development of genetic algorithms for the finite capacity scheduling of complex products,with multiple levels of product structure.European Journal of Operational Research,2004,152(1):215-225.
[119]ZX Guo,WK Wong,SYS Leung,et al.Mathematical model and genetic optimization for the job shop scheduling problem in a mixed-and multi-product assembly environment:A case study based on the apparel industry.Computers and Industrial Engineering,2006,50:202-219.
[120]G.Vilcot,J.-C.Billaut,A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem,European Journal of Operational Research(2007),doi:10.1016/j.ejor.2007.06.039.
[121]尹文君,刘民,吴澄.进化计算在生产线调度研究中的现状与展望.计算机集成制造系统-CIMS,2001,7(12):1-6.
[122]Metaxiotis K S,Psarras J E,Askounis D.Building ontologies for production scheduling systems:towards a unified methodology.Information Management & Computer Security.2001,9(1):44-50.
[123]Bagley J D.The Behavior of Adaptive system which Employ Genetic and Correlation Algorithm:(PhD Dissertation).University of Michigan,1967.
[124]Goldberg D E.Genetic Algorithm in Search,Optimization and Machine Learning.Addision-Wesley,1989.
[125]Cheng R,Gen M,Tsujimura Y.A tutorial survey of jobshop scheduling problems using genetic algorithms,part Ⅰ:representation.Computers & Industrial Engineering,1996,30(4):983-997.
[126]Tsujimura Y,Gen M,Cheng R,Momota T.Comparative studies on encoding methods of GA for open shop scheduling.Australian Journal of Intelligent Information Processing Systems,Vol.4,no.3-4,pp.214-219,1997.
[127]Pinedo,M L.Scheduling:Theory,Algorithms,and Systems,2nd ed.,2002,Prentice Hall.
[128]Coello C A C.Theoretical and numerical constraint-handling techniques used with evolutionary algorithms:a survey of the state of the art.Comput.Methods Appl Mech Engrg,2002,191:1245-1287.
[129]Goldberg D E,Deb K,Korb B.Messy genetic algorithms revisited:studies in mixed size and scale.Complex Systems,1990,4,415-444.
[130]Michalewicz Z.A survey of constraint handling techniques in evolutionary computation methods,in:J.R.McDonnell,R.G.Reynolds,D.B.Fogel(Eds.),Proceedings of the Fourth Annual Conference on Evolutionary Programming,MIT Press,Cambridge,MA,1995,pp.135-155.
[131]高玉根,程峰,王灿,等.基于违约解转化法的遗传算法及其性能分析.电子学报,2006,4:638-641.
[132]郭冬芬,李铁克.基于约束满足的车间调度算法综述.计算机集成制造系统,2007年,13(1):117-125.
[133]杨晓梅,曾建潮.采用多个体交叉的遗传算法求解作业车间问题.计算机集成制造系统,2004,10(9):1114-1119.
[134]王超.基于遗传算法的产品装配生产调度优化研究:(硕士学位论文).武汉:武汉大学,2005.
[135]高永超.智能优化算法的性能及搜索空间研究:(博士学位论文).山东:山东大学,2007.
[136]Guoyong SHI,Hitoshi IIMA,Nobuo SANNOMIYA.A New Encoding Scheme for Solving Job Shop Problems by Genetic Algorithm.Proceedings of the 35th Conference on Decision and Control,Kobe,Japan December 1996:4395-4400.
[137]上官春霞,周泓,师瑞峰等.求解作业排序问题的一种改进修复约束满足算法.控制与决策,2008,23(8):850-856.
[138]王波,张群,王飞等.Job Shop排序问题解空间定量分析.控制与决策,2001,16(1):33-36.
[139]谢胜利,黄强,董金祥.求解JSP的遗传算法中不可行调度的方案.计算机集成制造系统,2002,8(11):903-906.
[140]Liepins,G.E.and W.D.Potter.A Genetic Algorithm Approach to Multiple-Fault Diagnosis.In Davis(ed.),Handbook of Genetic Algorithms,Van Nostrand Reinhold.1991.
[141]ORVOSH D,DAVIS L.Using a genetic algorithm to optimize problems with feasibility constraints.Proceedings of the First IEEE Conference on Evolutionary Computation. New York,WA,USA:IEEE Service Center.1994.548-553.
[142]Coello C A C,Efren Mezura Montes.Constraint-Handling in Genetic Algorithms Through the Use of Dominance-based Tournament Selection.Advanced Engineering Informatics.2002,16(3):193-203.
[143]孙志峻.智能制造系统车间生产优化调度:(博士学位论文).南京:南京航空航天大学,2002.
[144]郑欣,杨丽徙,谢志棠.配电网络重构的改进混合遗传算法.继电器,2004,32(5):11-14.
[145]Ozgur Yeniay.PENALTY FUNCTION METHODS FOR CONSTRAINED OPTIMIZATION WITH GENETIC ALGORITHMS.Mathematical and Computational Applications,2005,Vol.10,No.1,pp.45-56.
[146]王凌,何锲,金以慧.智能约束处理技术综述.化工自动化及仪表,2008,35(1):1-7.
[147]Linping Wang,Zhenyuan Jia,Fuji Wang.Solving Complete Job Shop Scheduling Problem Using Genetic Algorithm,Proceeding of The 7-th World Congress on Intelligent Control and Automation,Chongqing,P.R.China,June 25-27,2008.
[148]Brooming T R.Applying the Design Structure Matrix to System Decomposition and Integration Problems:A Review and New Directions,IEEE Transactions on Engineering Management,48(3)(2001) 292-306.
[149]Sharman D M,Yassine A A.Characterizing Complex Product Architectures.Systems Engineering,2004,7(1):35-69.
[150]Donis Marshall著,许华杰,刘光惠译.Visual C#2005技术内幕.北京:清华大学出版,2007:5-18.
[151]Bierwirth C,Mattfeld D C,Kopfer H.On permutation representations for scheduling problems//Lecture Notes in Computer Science,Springer Berlin/Heidelberg,1996,Vol.1141,Parallel Problem Solving from Nature—PPSN Ⅳ.
[152]Wiese K,Goodwin S D,Nagarajan S.ASERC-A Genetic Sequencing Operator for Asymmetric Permutation Problems//Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence:Advances in Artificial Intelligence,London,UK:Springer-Verlag,2000,1822:201-213.
[153]MASATO WATANABE,KENICHI IDA,MITSUO GEN.Active Solution Space and Search on Job-Shop Scheduling Problem.Electrical Engineering in Japan,2006,154(4):61-67.
[154]阮吉寿,张华.信息论基础(译),北京:机械工业出版社,2008.1.
[155]Cheng R,Gen M,Tsujimura Y.A tutorial survey of job shop scheduling problems using genetic algorithms,part Ⅱ:hybrid genetic search strategies.Computers and Industrial Engineering,1999,36:343-364.
[156]王健,王建华.标准遗传算法的研究进展[J].华东船舶工业学院学报,2000,14(3):28-35.
[157]王秀娟.正交均匀设计在遗传算法初始编码中的应用.潍坊学院学报,2007,7(6):108-110.
[158]李志俊,程家兴.基于数论佳点集的遗传算法初始种群均匀设计.电脑与信息技术,2007,15(4):29-32.
[159]何大阔,王福利,贾明兴.遗传算法初始种群与操作参数的均匀设计.东北大学学报(自然科学版),2005,26(9):828-831.
[160]胡建军,唐常杰,段磊,等.基因表达式编程初始种群的多样化策略.计算机学报,2007,30(2):305-310.
[161]杜宏伟,潘志国,林悦香,等.遗传算法解决车间作业调度问题的优化研究.组合机床与自动化加工技术,2007,(5):109-112.
[162]谢志强,刘胜辉,乔佩利.电机产品加工的动态调度算法.计算机集成制造系统,2003,9(6):444-448.
[163]谢志强,刘胜辉,乔佩利.基于ACPM和BFSM的动态Job-Shop调度算法.计算机研究与发展,2003,40(7):79-85.
[164]唐国春.2003年到2005年排序(调度)学科在中国的发展(Ⅰ).上海第二工业大学学报,2006,23(3):167-176.
[165]季敏.当代工业中的若干排序问题研究:(博士学位论文).杭州:浙江大学,2006.3.
[166]吴秀丽.多目标柔性Job Shop调度问题的技术现状和发展趋势.计算机应用研究,2007,24(3):1-5.
[167]Murata T,Ishibuchi H,Lee K H.Reformulation of Various Non-Fuzzy Scheduling Problem s Using the Concept of Fuzzy Due-Date.Proceedings of 6th IEEE International Conference on Fuzzy System s,1997:447-452.
[168]Murata T,GenM,Ish ibuch iH.Multi-Objective Scheduling with Fuzzy Due-Date.Computers ind Engng,1998,35(3-4):439-442.
[169]Murata T,O sh ida H,JenM.Rule-Based Weight Definition Form Objective Fuzzy Scheduling with the OWA Operator.The Proceedings of 26th Annual Conference of the IEEE on Industrial Electronics Society,2000,4:2756-2761.
[170]Masato shi S,Ryo K.Fuzzy Programming for Multi-Objective Job Shop Scheduling with Fuzzy Processing Time and Fuzzy Duedate through Genetic Algorithms.European Journal of Operational Research,2000,120(2):393-407.
[171]Baker K R,SMITH J C.A MULTIPLE-CRITERION MODEL FOR MACHINE SCHEDULING.Journal of Scheduling.2003,(6):7-16.
[172]Li F,Zhu Y,Yin C.Fuzzy Programming for Multiobjective Fuzzy Job Shop Scheduling with Alternative Machines through Genetic Algorithm s.The Proceedings of 2005International Conference on Natural Computation,2005,992-1004.
[173]吴秀丽,孙树栋,杨展,等.面向工件的多目标柔性Job Shop调度问题研究.西北工业大学学报,2006,24(4):477-481.
[174]谭芳,孙世杰.宽容交货加权超前延误单机排序问题.上海大学学报(自然科学版),2005,11(2):149-154.
[175]刘朝晖,俞文.成组加工的单机延误工件个数问题.华东理工大学学报.1998,24(2):235-242.
[176]Zhi-Long Chen,Guruprasad Pundoor.Order Assignment and Scheduling in a Supply Chain.OPERATIONS RESEARCH,2006,54(3):555-572.
[177]IRAVANI S M R,LUANGKESORN K L,SIMCHI-LEVI D.On assemble-to-order systems with flexible customers,IIE,2003,35:389-403.
[178]CHENG T C E,KANG Li-ying,NG C T.Due-date assignment and single machine scheduling with deteriorating jobs.Journal of the Operational Research Society,2004,55:198-203.
[179]CHENG T C E,KANG Li-ying,NG C T.Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.International Transactions in Operational Research,2005,12:335-366.
[180]Lin Shih-Wei,Chou Shuo-Yan,Chen Shih-Chieh.Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date.Journal of Heuristics.2007,13:151-165.
[181]Julien FM,Magazine MJ(1990) Scheduling customer orders:an alternative production scheduling approach.J Manuf Oper Man 3:177-199.
[182]司昕,郑应平,安燮南.具有多种工件类型的最小订单延期数问题.自动化学报,2000,26(6):845-847.
[183]王书峰,刘海成.混合整数规划的约束规划在订单排产中的应用.郑州大学学报(工学版)2002,23(2):13-15.
[184]刘静,孙世杰,陈跃.订单带多工类工件的极小迟后范围问题.运筹学学报,2006,10(3):91-98.
[185]Erel E,Ghosh JB(2007) Customer order scheduling on a single machine with family setup times:complexity and algorithms.App Math Comput 185:11-18.
[186]Oncu Hazir,Yavuz Gunalay,Erdal Erel.Customer order scheduling problem:a comparative metaheuristics study.Int J Adv Manuf Technol.2008,37:589-598.
[187]JAEHWAN YANG,POSNER M E.SCHEDULING PARALLEL MACHINES FOR THE CUSTOMER ORDER PROBLEM.Journal of Scheduling.2005,8:49-74.
[188]Ahmadi R,Bagchi U,Roemer T A.Coordinated Scheduling of Customer Orders for Quick Response.Naval Research Logistics.2005,52:493-512.
[189]Leung J Y-T,Haibing Li,Pinedo M.ORDER SCHEDULING MODELS:AN OVERVIEW.In Multidisciplinary Scheduling:Theory and Applications.Springer US,2005.
[190]JosephY-T,Leunga,Haibing Lia,Michael Pinedo.Scheduling orders for multiple product types to minimize total weighted completion time.Discrete Applied Mathematics.2007,155:945-970.
[191]Blocher J D,Chhajed D,Leung M.Customer Order Scheduling in a General Job Shop Environment.Decision Sciences.1998,29(4):951-981.
[192]李浩,沈祖志,邓明荣.订货型企业基于约束理论的订单排产优化研究.中国机械工程.2004,15(10):865-869.
[193]Guo Z X,Wong W K,Leung S Y S,et al.Genetic optimization of order scheduling with multiple uncertainties,Expert Systems with Applications(2007),doi:10.1016/j.eswa.2007.08.058.
[194]周水银,盛培锋.一种单机加权成套订单数问题的遗传算法.工业工程与管理.2006,(6):75-79.
[195]吴春辉,周水银.并行多机加权成套订单数极大化的混合遗传算法.系统工程理论与实践.2006,(11):125-129.
[196]周水银,盛培锋.面向成套订单问题的工艺规划与排序的集成研究.中国管理科学.2006,14(5):73-80.
[197]苏亚.单机带调整时间加权成套订单数问题遗传算法研究.工业工程,2007,10(3):119-122.
[198]苏亚,傅青.并行机含调整时间成套订单数问题遗传算法.控制工程,2007,14(1):78-81.
[199]周水银,傅青.最大化流水作业加权成套订单数的研究.控制工程,2007,14(2):212-214.
[200](日)木村博光著.刘蔚三,李坤堂译.如何实施正确的生产管理.北京:北京大学出版社,2004.
[201]蔡良伟,胡世曦.基于相似性遗传算法及其在JSP中的应用.深圳大学学报(理工版).2006,23(2):107-111.
[202]陈世哲,刘国栋,浦欣,浦昭邦,胡涛,刘宛予.基于优势遗传的自适应遗传算法.哈尔滨工业大学学报,2007,39(7):1021-1024.
[203]张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题.中国机械工程.2004,15(23):2149-2153.
[204]李怀祖.生产计划与控制(修订版).北京:中国科学技术出版社,2005.4.
[205]何霆,刘飞,马玉林.车间生产调度问题研究.机械工程学报,2002,36(5):97-102.
[206]唐国春.2003年到2005年排序(调度)学科在中国的发展(Ⅱ).上海第二工业大学学报,2006,23(4):261-271.
[207]金锋,吴澄.大规模生产调度问题的研究现状与展望.计算机集成制造系统,2006,12(2):161-168.
[208]李娟,刘旭.精益化装配管理.中国计量出版社,2006.
[209]张居阳,孙吉贵.组合优化调度问题求解方法.计算机科学,2003,30(2):9-16.
[210]徐俊刚,戴国忠,王宏安.生产调度理论和方法研究综述.计算机研究与发展,2004,41(2):257-267.
[211]朱剑英.智能系统非经典数学方法.武汉:华中科技大学出版社,2001.
[212]陈宗舜.制造业信息化与信息编码.北京:清华大学出版社,2004.
[213]李培根.制造系统性能分析建模.武汉:华中理工大学出版社,1998.
[214]陈红.如何进行生产作业管理.北京大学出版社.2004.1
[215]邢文训,谢金星.现代优化计算方法.北京:清华大学出版社,2005.9(第二版).
[216]陈宗舜.制造业信息化与信息编码.北京:清华大学出版社,2004.
[217]阿惟.Visual Basic.NET进销存程序设计.北京:清华大学出版社,2003.7.
[218](美)哈尔弗森著.Visual Basic.NET程序设计.北京:清华大学出版社,2002.
[219]赵增敏,朱粹丹.SQL Server 2000实用教程.北京:电子工业出版社,2002.
[220](美)Dejan Sunderic.SQL Server 2000存储过程与XML编程.北京:清华大学出版社,2003.
[221]王庆育.软件工程.北京:清华大学出版社,2004.7.
[222]Deitel H M,Deitel P J,Listfield J A,et al.C# for experienced programmers.Beijing:Pub.House of Electronics Industry,2003.
[223]James Foxall著,陈秋萍译.VisualC#2005入门经典.北京:人民邮电出版社,2007.
[224]Ben Albahari.C# Essentials.Publisher:O'Reilly,2001.
[225]李芳芸,柴跃廷.CIMS环境下集成化管理信息系统的分析、设计与实施.北京:清华大学出版社,1996.
[226]刘飞,杨丹,王时龙.CIMS制造自动化.北京:机械工业出版社,1997.
[227]陈启申.ERP-从内部集成起步.北京:电子工业出版社,2004.
[228]Tony Arnold J R.Introduction to Materials Management,second edition,PRENTICE HALL,1996.
[229]戴勇.数字化制造过程数字化管理.北京:科学出版社,2004.
[230]陈红.如何进行生产作业管理.北京:北京大学出版社2004.
[231]Vollmann T E,Berry W L,Whybark D C.Manufacturing planning and control systems.Fourth edition,Irwin/McGraw-Hill,1997.
[232]Jay neizer,Barry Render.PRINCIPLES OF OPERATIONS MANAGEMENT,Sixth edition,Prenhall,2006.