遗传算法在高级计划与排程问题中的若干应用研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
我国制造业面临着巨大的冲击和挑战,亟需加强产业链上下游企业的协作,在技术、管理和信息化建设方面进行升级,采用先进的制造理念和管理模式来提升企业竞争力。基于约束的高级计划和排程(APS)技术是真正的供应链优化引擎,能改善企业的整体管理水平,快速反应与适应竞争激烈且变化多端的市场,APS已成为支持企业协同计划最主要的手段之一。
     本文以APS系统中的若干问题为背景研究了遗传算法在其中的应用。通过对一些已有方法进行分析和比较,找到其不足并提出改进,给出更有效的解决方法,并对所提出的方法进行了实验验证。
     针对一个支持机器外包的APS问题给出一个改进的结合局部搜索的混合遗传算法LSHGA。提出松弛作业顺序的工序序列生成策略,提出基于邻域搜索的变异算子。
     针对一个集成资源选择和工序排序的多目标APS问题,提出一个有效的多目标遗传算法Y-MOGA。该算法基于非支配排序的概念寻找Pareto最优解集的近似,并给出规范化拥挤距离作为辅助排序标准;提出一个局部搜索过程对新产生的非支配解集进一步寻优。
     针对一个两阶段运输问题,提出一个两种群协同进化算法TPCEA。针对两个运输阶段,对比并找到一种最优的启发式方法组合,用于在解码过程中计算成本函数;提出一个基于两种群协同进化的选择方法,从可行域和不可行域两个方向同时搜索最优解。
     本文的研究工作预期对APS领域的研究起到一定推进作用,也为求解实际问题提供了几种可能的新方法,具有一定的理论意义和实际应用价值。
Since 1990s, the China's economy which major in manufacture has gotten rapid development. In global context of subprime lending crisis and financial crisis, the challenge that at the same time China's manufacturing industry future faces coexists with the opportunity. The developed countries shift their manufacturing to China to offset the adverse effect brought by their local economic recession, which will bring historic opportunity for the growing and upgrading of the industrial structure of China's manufacturing industry. However, the situation of China's manufacturing technology, especially the key technology which rely mainly on abroad has still not fundamentally changed. Especially in the context of the global economic slowdown caused by the US financial crisis, the external demand for related departments in China's manufacturing industry will drop off, many industries are faced with readjustment. China's manufacturing industry is facing a huge impact and challenges. To make our enterprise in competition invincible, make our country become a strong manufacture country, China manufacturing industry should strengthen the cooperation in the downstream enterprises, upgradation of the technology, management and informationization construction. Through advanced internal production plan and control technology, shorten the production makespan and procurement time, implement coordination and optimization of external supply chain, reduce stock fund, improve production efficiency, realizing the total management improvement, so as to response the serious and complex situation.
     For a long time, ERP system was widely used by enterprise to manage enterprise operation, and has created a glorious period of ERP practice. However, ERP is mainly for the management of enterprise internal resources, its core logic is based on the assumptions of infinite capacity and fixed lead time. It lack of optimization function, can not reflect the actual situation in the workshop and changes in order, hard to adapt to the changing demands of the modern enterprise, and also can not coordinate resources in multiple enterprises. In order to overcome the shortcomings of traditional ERP planning model, in the mid 1990s, the Advanced Planning and Scheduling (APS) system emerged.
     APS is the true supply chain optimization engine, it contains a large amount of mathematical models, optimization and simulation technology. It can respond to customer demands promptly, rapidly synchronize plan, provide accurate delivery date, reduce inventory of work in progress and finished product, considering all the constraints of supply chain, identificate potential bottlenecks automaticly, improve resource utilization, so as to improve the overall management level for enterprise. APS has become one of the main means which supporting inter-enterprise coordination.
     Some problems in the APS system were considered, which involving resources selection and outsourcing, operation sequencing, and transportation planning, in which the application of genetic algorithm has been primary studied. Through the analysis and comparisons between existing approaches, deficiency was found and improved new methods were proposed and verificated in experiment.
     For an APS problem with outsourcing machines an improved genetic algorithm LSHGA was proposed. In this problem, four stages are needed to satisfy customer demands: manufacturing, assembling, delivery, customers. Each customer order has a due date. Products in each order were manufactured, assembled, and delivered to customers. Each order consists a set of jobs, each job was composed by a set of operations. There may be precedence constraint exists between two operations. Each operation can be processed by a set of alternative machines. Some machines may be outsourcing ones. The objective is to find the optimal operation sequence and machine assignment, to minimize the makespan of all customer orders.
     In LSHGA, the topological sort algorithm was utilized to generate operation sequences in an order, and a job sequence relaxation strategy was proposed, in which for each order, the precedence constraint between operations in a job was considered, and there is not sequence constraint for operations in different jobs. Using the same bench mark problems and parameters, LSHGA was compared with a classical algorithms, the results show the effectiveness of the proposed strategy. This strategy can produce more alternative operation sequences, and none of the precedence constraint will be violated. Therefore this is an effectiveness strategy to increase the searching space of the algorithm. The results of experiments based on large size problems verified the effectiveness of the algorithm further. To improve the efficiency of LSHGA, a neighborhood search based mutation operator was proposed. For the chromosome represented by two dimensional vector, the perturbation mutation was employed on the machine assignment vector, and the neighborhood search based mutation was employed on the priority assignment vector. Experiment shows that, in LSHGA the mutation operator is the main operator which guide the search direction and plays an important role on improving the search ability of the algorithm.
     Based on an integrated resource selection and operation sequencing model, a multi-objective APS model. In this problem, an order consists of a set of uninterrupted operations. An operation can be processed on a set of alternative machines. Setup time and teardown time must be considered for each operation and machine. Transportation time must be considered for two machines. There isn't precedence constraint exist for two orders, and there may by precedence constraint between two operations. Each order has lot size. An operation can start as early as its all precedent operations have produced a certain number items, don't need to wait all its precedent operations completed. The process of an operation cann't be interrupted, a machine is nonpreempted. The objectives are: minimizing the makespan, minimizing the total transportation time, and balancing the workload.
     For this model, a multi-objective genetic algorithm Y-MOGA was proposed. In order to find an approximation of the Pareto optimal set, the proposed algorithm has made use of the principle of nondominated sorting, the fast nondominated sorting algorithm was used to divide the population into several nondominated fronts, then a deterministic selection strategy was employed to form the mating pool. In the choice procedure, for solutions belong to different nondominated fronts, the one belongs to smaller rank number will be preferred, for solutions belong to the same front, the one withe the larger crowding distance will be preferred. In the crowding distance computation procedure, considering the different range for each objective, the value of crowding distance for each objective was normalized, that is, to be scaled to the same range, so as to avoid the crowding distance be dominated by one objective. After crossover and muatation operators were applied on the mating pool, a new population was generated. To improve the search efficiency of the algorithm, a local search procedure was proposed and applied on the nondominated solutions of the new population. In the procedure, based on the crowding distance, only a specified number of solutions were selected for local search. The neighborhood of a solution is generated through insert operator applied on priority assignment vector, and perturbation operator was also applied on machine assignment vector. A nondominated solustions set was kept and updated at each generation. Y-MOGA was compared with the other related algorithms on different size of problems. The results show that, compared with the other two algorithms, Y-MOGA obtained most of the nondominated solutions, and the solutions were closer to the Pareto optimal front. In addition, the experiments based on the practical data verified the effectiveness of Y-MOGA further, and shows that the algorithm can be applied to the practical problems.
     For a two-stage transport problem, an effective two-population co-evolutionary algorithm TPCEA was proposed. In this problem, there are two stages transportation network. The product are manufactured in plants, and then transported to the distributation centers (DCs), and then to the customers. The maximum number of DCs is constrained due to the limited resource of enterprise. The objective is to determine the subsets of DCs to be opened and to design the transportation network that will satisfy all capacity constraints and the customer demand with minimum cost.
     In TPCEA, the chromosome is presented by priority based encoding. Each chromosome consists of two segments. Each of the segment is used to obtain a transportation tree of a stage. For each segment, the value of a gene is used to represent the priority of the node for constructing a tree among candidates. The chromosome is decoded on the backward direction. Firstly, transportation tree between opened DCs and customers is obtained with decoding of the second segment of chromosome. Secondly, transportation tree between plants and opened DCs is obtained with decoding of the first segment of chromosome. The transportation tree is generated by sequential arc appending between sources and depots. At each step, only one arc is added to tree by selecting a source or depot with the highest priority and connecting it to a depot or source considering minimum cost. The method of computing cost function affects deeply the overall performance of the algorithm. Therefore, 6 heuristics for computing the cost function were proposed. Through experiments the best combination of heuristics was adopted in the chromosome decoding procedure, That is, for the 2nd stage, unit transportation cost from DCs to customers combined with unit fixed cost of DCs is utilized to calculate the cost, for the 1st stage, unit transportation cost from plants to DCs is utilized as cost. Considering the maximum DCs number constraint, a two-population co-evolution approach was proposed, in which two populations were kept for feasible and infeasible solutions respectively. After crossover and mutation operators applied on the two populations, the new solutions were divided and moved into the two populations by their feasibility respectively, this procedure realized the information interchange between the feasible solutions set and infeasible ones. For the feasible solutions set, roulette wheel selection with elitist strategy was employed as a selection mechanisms. For population consists of infeasible solutions, the solutions were sorted in increasing order of the degree of constraint violation and total cost, then the top best solutions were selected for next generation. This approach make the TPCEA can search solutions from both feasible and infeasible regions, so the optimal solution can be easier to found. The experiments on different size of problems verified the effectiveness of the proposed approach.
     Comprehensive APS system is complicated. There has been many mature advanced planning systems, but the core of the APS system, i.e. the optimization engine is in still developing. Some domestic enterprises have developed practical systems in manufacturing industry, but only as a supplement of ERP system. There isn't exists domestic APS system which covers all supply chain levels with comprehensive functions. The domestic market is mainly occupied by foreign APS products. There is few research results which has important theoretical and practical significance at home currently. The research work in this paper is expected to play certain promotion effect to domestic APS research, and provides several optional approach for solving practical problems. Therefor, the research in this paper has certain theoretical significance and practical value.
引文
[1]蔡颖. APS走向实践[M].广东:广东经济出版社,2007.
    [2]蔡颖. ERP高级计划APS供应链优化引擎[M].广东:广东经济出版社,2004.
    [3]陈绍文. SCM、APS和ERP[J].计算机辅助设计与制造, 2001, (3):15-19.
    [4]曾小青,高阳. ERP生产计划新思路——基于协同制造网格的高级计划系统[J].科技进步与对策, 2005, (5):103-105.
    [5]陈启申. ERP-从内部集成起步.北京:电子工业出版社,2005.
    [6] Stadtler H. Supply chain management and advanced planning - Basics, overview and challenges [J]. European Journal of Operational Research, 2005. 163(3): 575-588.
    [7] Meyr H., Wagner M., Rohde J. Structure of advanced planning systems. In: Stadtler, H., Kilger, C. (Eds.), Supply Chain Management and Advanced Planning––Concepts, Models Software and Case Studies, Berlin, 2002: 99–104.
    [8] Ischmann B.F., Meyr H., Wagner M.. Advanced Planning. In: Stadtler, H., Kilger, C. (Eds.), Supply Chain Management and Advanced Planning––Concepts, Models, Software and Case Studies, Berlin, 2002: 71–96.
    [9] Rohde J.; Meyr H.; Wagner M. Die Supply Chain Planning Matrix. in: P PS-Mana gement, 2000, 5(1): 10-15.
    [10] John Layden. The Evolution of Scheduling Logic. APS, 1998, August, 23-25.
    [11] Donald E. Shobrys. The History of APS [C/OL]. 1998, http://www.dsc.com.tw/dsak/learning/mis/the%20history%20of%20APS.pdf
    [12] Errington J. Advanced Planning and Scheduling (APS): a powerful emerging technology [C]. 1997, London, UK: IEE.
    [13] Parker K. Advanced planning achieved by taping into computing's cutting-edge capabilities [J]. Manufacturing Systems, 1998, 16(2): 5.
    [14] Hill S Jr. Advanced planning creates a smooth flow [J]. MSI, 2001, 19(8): 37-42.
    [15] Chen J.-K. and A. Chen. ATS advanced planning and scheduling system [C]. Proceedings - IEEE International Conference on Robotics and Automation, Institute of Electrical and Electronics Engineers Inc.: Washington, DC, United States. 2002, (4): 3619-3623.
    [16] Kuroda M., H. Shin, and A. Zinnohara. Robust scheduling in an advanced planning and scheduling environment [J]. International Journal of Production Research, 2002, 40(15): 3655-3668.
    [17] Lee Y.H., C.S. Jeong, and C. Moon. Advanced planning and scheduling with outsourcing in manufacturing supply chain [J]. Computers and Industrial Engineering, 2002, 43(1-2): 351-374.
    [18] Liu W. et al. APS, ERP and MES systems integration for Semiconductor Backend Assembly [C]. Marine Mandarin, Singapore: Nanyang Technological University, Singapore, 639873, Singapore, 2002, 1:1403-1408.
    [19] Marriott P., et al., Advanced production planning as the core element of a supply chain [J]. MPT Metallurgical Plant and Technology International, 2002, 25(1):78-80+82+85.
    [20] Musselman K., J. O'Reilly, and S. Duket. The role of simulation in advanced planning and scheduling [C]. Winter Simulation Conference Proceedings. San Diego, CA, United States: Institute of Electrical and Electronics Engineers Inc, 2002, 2:1825-1830.
    [21] Moon C. and Y.H. Lee. Advanced process planning and scheduling with precedence constraints and machine selection using a genetic algorithm [J]. International Journal of Industrial Engineering: Theory Applications and Practice, 2003, 10(1): 26-34.
    [22] Romero J., et al. Integrating Budgeting Models into Scheduling and Planning Models for the Chemical Batch Industry [J]. Industrial and Engineering Chemistry Research, 2003, 42(24): 6125-6134.
    [23] Vandaele N. and L. De Boeck. Advanced Resource Planning [J]. Robotics and Computer Integrated Manufacturing, 2003, 19(1-2): 211-218.
    [24] Bartels N. Advanced planning's ongoing evolution [J]. MSI, 2004, 22(12): 32-34.
    [25] Moon C., J.S. Kim and M. Gen. Advanced planning and scheduling based on precedence and resource constraints for e-plant chains [J]. International Journal of Production Research, 2004, 42(15): 2941-2954.
    [26] Shin K., M. Kuroda, and S. Fukusako. A practical scheduling framework for component manufacturers in an APS environment [J]. Journal of Japan Industrial Management Association, 2004, 55(2): 59-68.
    [27] Tinham B. Chilling out on advanced planning [J]. Manufacturing Computer Solutions, 2004, 10(3): 26-27.
    [28] Zoryk-Schalla A.J., J.C. Fransoo and T.G. De Kok. Modeling the planning process in advanced planning systems. Information and Management, 2004, 42(1): 75-87.
    [29] Moon C. and Y. Seo. Evolutionary algorithm for advanced process planning and scheduling in a multi-plant [J]. Computers and Industrial Engineering, 2005, 48(2): 311-325.
    [30] Moon C. and Y. Seo. Advanced planning for minimizing makespan with load balancing in multi-plant chain [J]. International Journal of Production Research, 2005, 43(20): 4381-4396.
    [31] Chua T.J. et al. A heuristics-based advanced planning and scheduling system with bottleneck scheduling algorithm [C]. IEEE Symposium on Emerging Technologies and Factory Automation, ETFA. Hamburg, Germany: Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2006, 240-247.
    [32] David F., H. Pierreval and C. Caux. Advanced planning and scheduling systems in aluminium conversion industry [J]. International Journal of Computer Integrated Manufacturing, 2006, 19(7): 705-715.
    [33] Moon C. et al. Adaptive genetic algorithm for advanced planning in manufacturing supply chain [J]. Journal of Intelligent Manufacturing, 2006, 17(4): 509-522.
    [34] Zhang H. and M. Gen. Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system [C]. GECCO 2006 - Genetic and Evolutionary Computation Conference. Seattle, WA, United States: Association for Computing Machinery, New York, NY 10036-5701, United States, 2006, 2:1841-1848.
    [35] Chen K. and P. Ji. A mixed integer programming model for advanced planning and scheduling (APS) [J]. European Journal of Operational Research, 2007, 181(1): 515-522.
    [36] Chen K. and P. Ji. Dynamic advanced planning and scheduling with frozen interval for new orders [J]. Chinese Journal of Mechanical Engineering (English Edition), 2007, 20(4): 117-119.
    [37] Chen K.J. and P. Ji. A genetic algorithm for dynamic advanced planning and scheduling (DAPS) with a frozen interval [J]. Expert Systems with Applications, 2007, 33(4): 1004-1010.
    [38] Gen M., L. Lin, and H. Zhang. Multistage operation-based genetic algorithms: Optimizing advanced planning and scheduling [C]. ICMSEM: Proceedings of 2007 International Conference on Management Science and Engineering Management, Sichuan, China, 2007, 175-193.
    [39] Genin P., A. Thomas and S. Lamouri. How to manage robust tactical planning with an APS (Advanced Planning Systems) [J]. Journal of Intelligent Manufacturing, 2007, 18(2): 209-221.
    [40] Lin C.-H., S.-L. Hwang and E.M.-Y. Wang. A reappraisal on advanced planning and scheduling systems [J]. Industrial Management and Data Systems, 2007, 107(8): 1212-1226.
    [41] Voudouris C., et al. FOS: An advanced planning and scheduling suite for service operations [C]. Proceedings - ICSSSM'06: 2006 International Conference on Service Systems and Service Management, Troyes, France: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, 2007, 2:1138-1143.
    [42] Dorne R., C. Voudouris and G. Owusu. An advanced planning and scheduling platform for service enterprise [C]. Innovations'07: 4th International Conference on Innovations in Information Technology, Dubai, United Arab Emirates: Institute of Electrical andElectronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, 2008, 31-35.
    [43] Hadaya P. and R. Pellerin. Determinants of advance planning and scheduling systems adoption [C]. Proceedings - The 3rd International Conference on Software Engineering Advances, ICSEA 2008, Sliema, Malta: Inst. of Elec. and Elec. Eng. Computer Society, 2008, 494-499.
    [44] Liu L. and E.-S. Qi. Research of production logistics system in car factory based on advanced planning and scheduling [C]. 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008, Dalian, China: Inst. of Elec. and Elec. Eng. Computer Society, 2008.
    [45] Ning W. et al. Constraint engine in advanced planning and scheduling [C]. Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2008, Qingdao, China: Institute of Electrical and Electronics Engineers Computer Society, 2008, 935-939.
    [46] Ou-Yang C. and S.J. Hon. Developing an agent-based APS and ERP collaboration framework [J]. International Journal of Advanced Manufacturing Technology, 2008, 35(9-10): 943-967.
    [47] Kung L.-C. and C.-C. Chern. Heuristic factory planning algorithm for advanced planning and scheduling [J]. Computers and Operations Research, 2009, 36(9): 2513-2530.
    [48] Masuchun R. and W. Petchmaneelumka. Advanced planning for multi-product across a supply chain [C]. Proceedings - 2009 International Conference on Computer Modeling and Simulation, ICCMS 2009, Macau, China: Inst. of Elec. and Elec. Eng. Computer Society, 2009, 199-203.
    [49] Rudberg M. and J. Thulin. Centralised supply chain master planning employing advanced planning systems [J]. Production Planning and Control, 2009, 20(2): 158-167.
    [50]姜铁虎.供应链高级计划系统(APS) [EB/OL]. (2002-2-20). http://www.amteam.org/k/SCM/2002-2/441625.html
    [51]蔡颖. APS企业管理的难点[J]. IT经理世界, 2001, (8):88-89,91.
    [52]姜晓东.高级计划调度(APS)解决方案[J].印制电路信息, 2002, (11):64-66.
    [53]徐晓芳,张伟,叶春明. APS剖析[J].计算机辅助设计与制造, 2002, (4):13-14,17.
    [54]刘旭.制造业先进计划系统的作用[J].中国制造业信息化, 2003, (8):60-61.
    [55]刘旭.制造业的先进计划系统[J].机械工人.冷加工, 2003, (8):17-19.
    [56]石为人,余兵,张星.高级计划排产系统与ERP的集成设计及实现[J].重庆大学学报(自然科学版), 2003, (11):87-90.
    [57]丁斌,陈晓剑.高级排程计划APS发展综述[J].运筹与管理, 2004, (3):158-162.
    [58]刘向东.用APS正确思考[J].软件工程师, 2004, (9):60-62.
    [59]程文明,齐二石.制造业供应链外包下的高级计划与排程[J].组合机床与自动化加工技术, 2005, (5):93-95.
    [60]马琨.生产计划排程(APS)在唐山松下的应用[J].电焊机, 2005, (10):73-76.
    [61]张树槐. APS技术在中鼎公司ERP系统中的应用[J].中国机电工业, 2005, (9):69-70.
    [62]齐作玉.铝箔生产厂开发先进计划与排产系统的探讨[J].铝加工, 2005, (6):46-48,53.
    [63]齐作玉.大锻件厂开发先进的计划与排产系统的探讨[J].大型铸锻件, 2006, (1):46-48.
    [64]谭辉,张洪伟,朱丽. APS系统中基于改进的遗传算法的分布式排产研究[J].计算机应用研究, 2005, (6):80-83.
    [65]王法,聂荣,袁德成. APS理论与应用[J].物流科技, 2005, (7):91-94.
    [66]姚丽. 21世纪我国制造业信息化发展新趋势--APS、ERP和MES系统集成研究[J].物流技术, 2005, (10):242-245.
    [67]曾相戈,周志勇.揭开先进计划系统的神秘面纱[J].工业工程, 2005, (1):57-60.
    [68]曾小青,高阳. ERP生产计划新思路——基于协同制造网格的高级计划系统[J].科技进步与对策, 2005, (5):103-105.
    [69]有利软件集团“Profits APS9.2”高级计划排程[J].电气制造, 2006, (3):93-94.
    [70]大连石化实施APS/MES系统记[J].数字石油和化工,2006,(6):19-20.
    [71]耿军.看中高级计划排产功能——昆明积大制药实施CDC软件Ross ERP[J].每周电脑报, 2006, (27):21.
    [72]蒋庆记,黄士柱,杨震,淡军.济钢坯材高级计划排程系统的开发和应用[J].山东冶金, 2006, (1):61-63.
    [73]刘亮,齐二石.高级计划与排程在MTO型企业中的应用研究[J].组合机床与自动化加工技术, 2006, (10):104-107.
    [74]刘亮,齐二石.基于APS与MES集成的车间生产计划和调度方法研究[J].制造技术与机床, 2006, (9):30-34.
    [75]齐二石,刘亮.面向订单生产APS的关键流程分析及其应用方法研究[J].制造业自动化, 2006, (12):36-39,70.
    [76]谢冰冰.嵌入ERP的供应链APS系统[J].价值工程, 2006, (8):65-67.
    [77]河南众品食业APS系统成功上线[J].肉类研究, 2007, (4):56-57.
    [78]陈淮莉.基于APS的供应链动态性能[J].上海海事大学学报, 2007, (3):57-62.
    [79]陈守乾.高级供应链计划在济钢的应用[J].山东冶金, 2007, (S2):105-107.
    [80]段传林.按订单生产的高级计划与排程系统研究[J].现代计算机, 2007, (4):112-114.
    [81]段传林.基于蚁群——遗传混合算法的高级计划与排产系统应用研究[J].电脑知识与技术(学术交流), 2007, (7):232-234,238.
    [82]卢安文,王楠.如虎添翼——基于在电信行业ERP系统中嵌入APS的思索[J].商场现代化, 2007, (15):83-84.
    [83]邵志芳,钱省三,刘仲英.在半导体制造业导入高级规划与排程系统[J].半导体技术, 2007, (8):22-25.
    [84]王丹,张浩.离散制造业APS生产数据结构的研究及应用[J].机电一体化, 2007, (2):24-27,37.
    [85]王丹,张浩,陆剑峰.基于瓶颈约束的APS算法研究与应用[J].机电一体化, 2007, (6):41-45.
    [86]王华,杨磊,陈锦生.先进计划系统在锦西石化中的应用[J].石油规划设计, 2007, (5):29-31,54.
    [87]翁元,周跃进,朱芳菲.基于约束理论的制造业高级计划排程模型的建立及应用[J].中国管理信息化(综合版), 2007, (9):19-23.
    [88]丁谋.浅谈高级计划与排程[J].航空制造技术, 2008, (17):68-69.
    [89]黄雄,廖小平.基于产能约束下的APS管理系统的应用研究[J].广西工学院学报, 2008, (2):41-44,53.
    [90]江资斌,汤捷.供应链高级计划系统理论研究述评[J].求索, 2008, (10):59-61.
    [91]刘海江,汪进. APS与传统CRP的能力需求分析比较[J].机械设计与制造, 2008, (10):63-65.
    [92]卢少华. APS:制造业瓶颈的终极解决方案[J].机械制造, 2008, (2):63-65.
    [93]陆杉.浅析APS在供应链中的应用[J].中国管理信息化, 2008, (20):77-80.
    [94]马国钧.从ERP、MES到APS——寻找提高企业效率和效益的利器[J].中国军转民, 2008, (8):38-40.
    [95]马国钧,.从ERP、MES到APS——寻找提高企业效率和效益的利器[J].装备制造, 2008, (9):66-69.
    [96]魏震.宝信制造业执行系统BM2中的高级计划排程[J].自动化仪表, 2008, (2):16-19.
    [97]肖牧山,鲁砾.基于APS与ERP集成的新型ERP/APS/MES企业管理系统[J].企业技术开发, 2008, (9):15-18.
    [98]杨敏.先进计划与调度(APS)的研究现状和发展趋势[J].中国高新技术企业, 2008, (14):42-43.
    [99]陈斌.马钢新区冷轧高级排程系统浅析[J].安徽冶金, 2009, (2):51-54.
    [100]曾小青,刘宁,肖海燕.实现供货能力承诺的企业高级计划系统研究[J].长沙理工大学学报(社会科学版), 2009, (2):19-23.
    [101] Konak A., D.W. Coit, and A.E. Smith. Multi-objective optimization using genetic algorithms: A tutorial [J]. Reliability Engineering and System Safety, 2006, 91(9): 992-1007.
    [102] Holland JH. Adaptation in natural and artificial systems [M]. Ann Arbor: University of Michigan Press; 1975.
    [103] Schaffer JD. Multiple objective optimization with vector evaluated genetic algorithms [C]. In: Proceedings of the international conference on genetic algorithm and their applications, 1985.
    [104] Fonseca CM, Fleming PJ. Multiobjective genetic algorithms [C]. In: IEE colloquium on‘Genetic Algorithms for Control Systems Engineering’, London, UK: IEE; 1993.
    [105] Horn J, Nafpliotis N, Goldberg DE. A niched Pareto genetic algorithm for multiobjective optimization [C]. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence, Orlando, FL, USA: IEEE; 1994.
    [106] Hajela P, lin C-y. Genetic search strategies in multicriterion optimal design [J]. Struct Optimization 1992, 4(2): 99–107.
    [107] Murata T, Ishibuchi H. MOGA: multi-objective genetic algorithms [C]. In: Proceedings of the 1995 IEEE international conference on evolutionary computation, Perth, WA, Australia: IEEE, 1995.
    [108] Srinivas N, Deb K. Multiobjective optimization using nondominated sorting in genetic algorithms [J]. J Evol Comput 1994, 2(3): 221–48.
    [109] Zitzler E, Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach [J]. IEEE Trans Evol Comput 1999, 3(4): 257–71.
    [110] Zitzler E, Laumanns M, Thiele L. SPEA2: improving the strength Pareto evolutionary algorithm [C]. Swiss Federal Institute Techonology: Zurich, Switzerland, 2001.
    [111] Knowles JD, Corne DW. Approximating the nondominated front using the Pareto archived evolution strategy [C]. Evol Comput 2000, 8(2): 149–72.
    [112] Corne DW, Knowles JD, Oates MJ. The Pareto envelope-based selection algorithm for multiobjective optimization [C]. In: Proceedings of sixth international conference on parallel problem solving from Nature, Paris, France: Springer, 2000.
    [113] Corne D, Jerram NR, Knowles J, Oates J. PESA-II: region-based selection in evolutionary multiobjective optimization [C]. In: Proceedings of the genetic and evolutionary computation conference (GECCO- 2001), San Francisco, CA, 2001.
    [114] Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II [C]. IEEE Trans Evol Comput 2002, 6(2):182–97.
    [115] Coello CAC, Pulido GT. A micro-genetic algorithm for multiobjective optimization [C]. In: Evolutionary multi-criterion optimization. First international conference, EMO 2001, Zurich, Switzerland: Springer, 2001.
    [116] Murata T, Ishibuchi H. MOGA: multi-objective genetic algorithms [C]. In: Proceedings of the 1995 IEEE international conference on evolutionary computation, Perth, WA, Australia: IEEE, 1995.
    [117] Murata T, Ishibuchi H, Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling [J]. Comput Ind Eng 1996, 30(4): 957–68.
    [118] Lu H, Yen GG. Rank-density-based multiobjective genetic algorithm and benchmark test function study [J]. IEEE Trans Evol Comput 2003, 7(4): 325–43.
    [119] Yen GG, Lu H. Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation [J]. IEEE Trans Evol Comput 2003, 7(3): 253–74.
    [120] Kursawe F. A variant of evolution strategies for vector optimization [C]. In: Parallel problem solving from nature. First workshop, PPSN 1 proceedings, Dortmund, West Germany: Springer, 1991.
    [121] Goldberg DE. Genetic algorithms in search, optimization, and machine learning [M]. Reading, MA: Addison-Wesley, 1989.
    [122] Goldberg DE, Richardson J. Genetic algorithms with sharing for multimodal function optimization [C]. In: Genetic algorithms and their applications: proceedings of the second international conference on genetic algorithms, Cambridge, MA, USA: Lawrence Erlbaum Associates, 1987.
    [123] Konak A, Smith AE. Capacitated network design considering survivability: an evolutionary approach [C]. J Eng Optim 2004, 36(2): 189–205.
    [124] Ishibuchi H, Murata T. Multi-objective genetic local search algorithm [C]. In: Proceedings of the IEEE international conference on evolutionary computation, Nagoya, Japan: IEEE, 1996.
    [125] Jimenez F, Verdegay JL, Gomez-Skarmeta AF. Evolutionary techniques for constrained multiobjective optimization problems [C]. In: Workshop on multi-criterion optimization using evolutionary methods GECCO-1999, 1999.
    [126] Jimenez F, Gomez-Skarmeta AF, Sanchez G, Deb K. An evolutionary algorithm for constrained multi-objective optimization [C]. In: Proceedings of the 2002 world congress on computational intelligence-- WCCI’02, Honolulu, HI, USA: IEEE, 2002.
    [127] Chung D. et al. A new approach to job shop scheduling problems with due date constraints considering operation subcontracts [J]. International Journal of Production Economics, 2005, 98(2): 238-250.
    [128] Liu X., et al. A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems [J]. International Journal of Production Research, 2008, 46(18): 5059-5074.
    [129] Mishra N., A.K. Choudhary and M.K. Tiwari, Modeling the planning and scheduling across the outsourcing supply chain: A Chaos-based fast Tabu-SA approach [J]. International Journal of Production Research, 2008, 46(13): 3683-3715.
    [130] Liu X. and J. Zhang. A capacitated production planning with outsourcing: A general model and its algorithm [C]. Kunming, China: Springer Verlag, 2006.
    [131] Qi X. Two-stage production scheduling with an option of outsourcing from a remote supplier [J]. Journal of Systems Science and Systems Engineering, 2009, 18(1): 1-15.
    [132] Horowitz E, Sahni S. Fundamentals of data structures in Pascal [M]. Rockville, MD: Computer Science Press, 1984.
    [133] Harada K., K. Ikeda and S. Kobayashi. Hybridization of genetic algorithm and local search in multiobjective function optimization: Recommendation of GA then LS [C]. Seattle, WA, United states: Association for Computing Machinery, 2006
    [134] Xu Y.-L. et al. A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem [C]. Seattle, WA, United states: Association for Computing Machinery, 2006.
    [135] Yun Y., C. Moon and D. Kim. Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems [J]. Computers and Industrial Engineering, 2009, 56(3): 821-838.
    [136] Tseng L.-Y. and Y.-T. Lin. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem [J]. European Journal of Operational Research, 2009, 198(1): 84-92.
    [137] Essafi I., Y. Mati and S. Dauzere-Peres. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem [J]. Computers and Operations Research, 2008, 35(8): 2599-2616.
    [138] Hans-Georg B. The Theory of Evolution Strategies [M]. Berlin: Springer-Verlag, 2001.
    [139] Moon C., et al. Integrated machine tool selection and operation sequencing with capacity and precedence constraints using genetic algorithm [J]. Computers and Industrial Engineering, 2002, 43(3): 605-621.
    [140] Lee D.H., D. Kiritsis and P. Xirouchakis. Iterative approach to operation selection and sequencing in process planning [J]. International Journal of Production Research, 2004, 42(22): 4745-4766.
    [141] Okamoto A., M. Gen, and M. Sugawara. Integrated data structure and scheduling approach for manufacturing and transportation using hybrid genetic algorithm [J]. Journal of Intelligent Manufacturing, 2006, 17(4): 411-421.
    [142] Zhang H., M. Gen and Y. Seo. An effective coding approach for multiobjective integrated resource selection and operation sequences problem [J]. Journal of Intelligent Manufacturing, 2006, 17(4): 385-397.
    [143] Gao J., M. Gen and L. Sun. A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem [C]. Seattle, WA, United states: Association for Computing Machinery, 2006.
    [144] Gao J., et al., A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems [J]. Computers and Industrial Engineering, 2007, 53(1): 149-162.
    [145] Deb K. and S. Tiwari. Omni-optimizer: A procedure for single and multi-objective optimization [C]. Guanajuato, Mexico: Springer Verlag, 2005.
    [146] Deb K. and S. Tiwari. Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization [J]. European Journal of Operational Research, 2008, 185(3): 1062-1087.
    [147] Arroyo J.E.C. and V.A. Armentano. Genetic local search for multi-objective flowshop scheduling problems [J]. European Journal of Operational Research, 2005, 167(3): 717-738.
    [148] Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multi-objective genetic algorithm-NSGA-II [J]. IEEE Trans Evo Comput, 2002, 6: 182–197.
    [149] Zitzler E, Deb K, Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results [J]. Evol Comput, 2000, 8: 173–195.
    [150] Deb K, Agrawal S, Pratap A, Meyarivan T. A fast elitist non-dominated sorting genetic algorithm for multiobjective optimization: NSGA-II [J]. Paral Prob Solv Natu, 2000, 1917: 849–858.
    [151] Kacem I., S. Hammadi and P. Borne. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic [J]. Mathematics and Computers in Simulation, 2002, 60(3-5): 245-276.
    [152] Barbarosoglu G. and Y. Arda. A two-stage stochastic programming framework for transportation planning in disaster response [J]. Journal of the Operational Research Society, 2004, 55(1): 43-53.
    [153] Poh K.L., K.W. Choo and C.G. Wong. A heuristic approach to the multi-period multi-commodity transportation problem [J]. Journal of the Operational Research Society, 2005, 56(6): 708-718.
    [154] Eksioglu S.D., B. Eksioglu and H.E. Romeijn. A Lagrangean heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain [J]. IIE Transactions (Institute of Industrial Engineers), 2007, 39(2): 191-201.
    [155] Gen M., K. Ida and Y. Li. Bicriteria transportation problem by hybrid genetic algorithm [J]. Computers and Industrial Engineering, 1998, 35(1-2): 363-366.
    [156] Gen M., L.I. Yinzhen and K. Ida. Solving multi-objective transportation problem by spanning tree-based genetic algorithm [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 1999, E82-A(12): 2802-2810.
    [157] Syarif A. and M. Gen. Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm [J]. Journal of Intelligent Manufacturing, 2003, 14(3-4): 389-399.
    [158] Gen M., F. Altiparmak and L. Lin. A genetic algorithm for two-stage transportation problem using priority-based encoding [J]. OR Spectrum, 2006, 28(3): 337-354.
    [159] Altiparmak F., et al. A genetic algorithm approach for multi-objective optimization of supply chain networks [J]. Computers and Industrial Engineering, 2006, 51(1): 196-215.
    [160] Altiparmak F., et al. A steady-state genetic algorithm for multi-product supply chain network design [J]. Computers and Industrial Engineering, 2009, 56(2): 521-537.