装配型供应链调度与协调研究
|
摘要
信息与计算机技术的普及给市场竞争模式带来了革命性的变化,传统的以企业为单元的竞争发展为以供应链为单元的竞争模式。有效的供应链管理为现代企业带来了巨大价值,体现在运输、库存成本的大幅降低,订单处理周期的缩短,综合绩效与客户满意度的提升等方面。供应链调度是传统调度在供应链模式下的一种发展。供应链调度沿承了传统调度的理论价值和应用价值,其问题范围更加宽广,层次更加复杂,并凸显出供应链成员之间的协调及信息共享等新问题,已成为应用数学、运筹学、博弈论、信息系统乃至智能体等多领域的研究热点。本文将纳什讨价还价理论引入供应链调度领域,建立了供应链调度的讨价还价模型,旨在为各种不同背景下的供应链调度问题提供一种合理、有效、可行的协调方法。论文主要工作如下：
1将传统调度博弈问题拓展到供应链范畴,提出了供应链调度博弈问题。探讨了供应链调度过程中的成员关系及决策冲突问题,将其归纳为一种以成员为参与人,调度方案为策略集,调度目标函数为支付的合作博弈关系。将纳什讨价还价理论引入供应链调度领域,建立了供应链调度的讨价还价模型。模型所取得调度结果的个体理性与帕累托最优性特征表明了模型的合理性。
2以传统调度问题的三参数表达结构为基础,针对供应链调度提出了一套新型问题表达方法。新表达方法沿袭了传统车间调度问题三参数表达法的惯用记号及参数结构,并在各参数域中纳入了供应链的组成、系统约束、系统目标等内容。各个成员内部的机器类型特征、约束、局部目标也在新表达法中充分体现,并且与供应链的组成形成了明确的一一对应关系。新方法尤其适合于表达多阶段链条结构和复杂的供应网络结构。
3选取典型的装配系统为模型的应用背景,基于对供应商参与或主导开发模式下成员关系新特征的把握,提出了一种供应商参与调度的分布式决策协调方式,并设计了此协调方式下的两类协议。分别针对每类协议,应用所建立的讨价还价模型,讨论了不同机器环境、约束及目标下的调度博弈问题。在讨价还价方式下,调度问题呈现出一种新的特点：其目标函数形式为乘积型,区别于传统问题的线性加权和型,、针对一系列调度问题,进行了启发式算法设计,如时问复杂度为O(n3)的HAPI算法等。并引入协调效率,排列逆序数等概念,为模型的协调效果评价提供了量化指标。数值实验分析结果验证了模型的有效性。
4利用智能体技术,设计了在有限理性成员在有限信息反馈下的规范化协商过程。通过数值实验分析研究了系统收敛问题和性能问题,研究表明模型能够满足实际供应链调度的客观条件限制,与实际生产情况较为贴近,具有一定的可行性。
The developing and popular of information, computer application has brought about a revolution in the market competition mode. The competition unit has been transformed from the enterprisers to supply chains. The effective supply chain management brings about great value for the company, including the reduction of transportation and inventory cost, the lessening of the order processing cycle, the improvement of comprehensive performance, and the promotion of customer satisfaction. Supply chain scheduling can be seen as the development of the traditional scheduling in supply chains. While retaining the considerable value in theory and application, supply chain scheduling targets the optimal problems in a more wide and complicated environment compared to the traditional research. Moreover, the problems of coordination and information sharing are highlighted in the expanded research area. Nowadays, the supply chain scheduling has been considered as the focus in relative research domains such as domain applied mathematics, operation research, game theory, information system, multi-agent system etc. The bargaining theory of Nash is introduced to supply chain scheduling domain. Aiming at providing a rational, effective and feasible method for supply chain scheduling in different context, a bargaining model is built in this dissertation. The main work is as follows:
1. The traditional scheduling game has been expanded to supply chain area, and the supply chain scheduling game problem is proposed. Based on the analysis of the member relationship and decision conflict, a cooperative game is used to demonstrate the supply chain scheduling problem. The members in the chains are considered as the players, whose strategies are the scheduling schemes. The pay off in the game is set as the objective of each member. The bargaining model of supply chain scheduling is built by introducing the Nash bargaining theory to supply chain research. The rationality of the model can be supported by the individual rationality and Pareto optimality of the solution.
2. On the basis of the three parameters expression method in tradition scheduling theory, a new expression method has been proposed for supply chain scheduling. The new method inherits the customary sign and structure of the traditional one, however, the supply chain composition, relative constrains, system objective are involved in each parameter domain. The machine character, constrains and individual objective of each member can be also found, and form a one-to-one correspondence in the composition of the new expression. Especially, the new method can clearly express the complicated structure such as multi-stage chain and networks.
3. The representative assembly system is selected to be the application background. Concerning the new characters of relationship between members in the context of supplier-manufacturer cooperative R&D. a supplier-manufacturer cooperative scheduling mode has been proposed to coordinate the decentralized decision. Meanwhile, two contracts are designed for the new cooperative scheduling mode. On the basis of each contract, the bargaining model is used to discuss the scheduling game concerning different machines, constrains and objectives. During the bargaining process, a novel kind of scheduling problem marked by its product form objective is displayed. The product form is distinguished from the traditional linear weighted sum form. Targeting the novel problems, the heuristics are designed to find the solution. The HAPI with O(n3) complexity is one of the example of the heuristics. Some concepts including cooperation efficiency and sequence inversions are introduced to provide the quantified index for the evaluation of the coordination result. Numerical experiments results validated the effectiveness of the model.
4. By using the agent technology, a normalized bargaining process between players with bounded rationality and information are designed. The convergence and efficiency performance of the system are investigated by numerical experiments. The results show that the system can fit the limitation of objective conditions in actual supply chain production, which supports the feasibility of the model proposed in this dissertation.
1将传统调度博弈问题拓展到供应链范畴,提出了供应链调度博弈问题。探讨了供应链调度过程中的成员关系及决策冲突问题,将其归纳为一种以成员为参与人,调度方案为策略集,调度目标函数为支付的合作博弈关系。将纳什讨价还价理论引入供应链调度领域,建立了供应链调度的讨价还价模型。模型所取得调度结果的个体理性与帕累托最优性特征表明了模型的合理性。
2以传统调度问题的三参数表达结构为基础,针对供应链调度提出了一套新型问题表达方法。新表达方法沿袭了传统车间调度问题三参数表达法的惯用记号及参数结构,并在各参数域中纳入了供应链的组成、系统约束、系统目标等内容。各个成员内部的机器类型特征、约束、局部目标也在新表达法中充分体现,并且与供应链的组成形成了明确的一一对应关系。新方法尤其适合于表达多阶段链条结构和复杂的供应网络结构。
3选取典型的装配系统为模型的应用背景,基于对供应商参与或主导开发模式下成员关系新特征的把握,提出了一种供应商参与调度的分布式决策协调方式,并设计了此协调方式下的两类协议。分别针对每类协议,应用所建立的讨价还价模型,讨论了不同机器环境、约束及目标下的调度博弈问题。在讨价还价方式下,调度问题呈现出一种新的特点：其目标函数形式为乘积型,区别于传统问题的线性加权和型,、针对一系列调度问题,进行了启发式算法设计,如时问复杂度为O(n3)的HAPI算法等。并引入协调效率,排列逆序数等概念,为模型的协调效果评价提供了量化指标。数值实验分析结果验证了模型的有效性。
4利用智能体技术,设计了在有限理性成员在有限信息反馈下的规范化协商过程。通过数值实验分析研究了系统收敛问题和性能问题,研究表明模型能够满足实际供应链调度的客观条件限制,与实际生产情况较为贴近,具有一定的可行性。
The developing and popular of information, computer application has brought about a revolution in the market competition mode. The competition unit has been transformed from the enterprisers to supply chains. The effective supply chain management brings about great value for the company, including the reduction of transportation and inventory cost, the lessening of the order processing cycle, the improvement of comprehensive performance, and the promotion of customer satisfaction. Supply chain scheduling can be seen as the development of the traditional scheduling in supply chains. While retaining the considerable value in theory and application, supply chain scheduling targets the optimal problems in a more wide and complicated environment compared to the traditional research. Moreover, the problems of coordination and information sharing are highlighted in the expanded research area. Nowadays, the supply chain scheduling has been considered as the focus in relative research domains such as domain applied mathematics, operation research, game theory, information system, multi-agent system etc. The bargaining theory of Nash is introduced to supply chain scheduling domain. Aiming at providing a rational, effective and feasible method for supply chain scheduling in different context, a bargaining model is built in this dissertation. The main work is as follows:
1. The traditional scheduling game has been expanded to supply chain area, and the supply chain scheduling game problem is proposed. Based on the analysis of the member relationship and decision conflict, a cooperative game is used to demonstrate the supply chain scheduling problem. The members in the chains are considered as the players, whose strategies are the scheduling schemes. The pay off in the game is set as the objective of each member. The bargaining model of supply chain scheduling is built by introducing the Nash bargaining theory to supply chain research. The rationality of the model can be supported by the individual rationality and Pareto optimality of the solution.
2. On the basis of the three parameters expression method in tradition scheduling theory, a new expression method has been proposed for supply chain scheduling. The new method inherits the customary sign and structure of the traditional one, however, the supply chain composition, relative constrains, system objective are involved in each parameter domain. The machine character, constrains and individual objective of each member can be also found, and form a one-to-one correspondence in the composition of the new expression. Especially, the new method can clearly express the complicated structure such as multi-stage chain and networks.
3. The representative assembly system is selected to be the application background. Concerning the new characters of relationship between members in the context of supplier-manufacturer cooperative R&D. a supplier-manufacturer cooperative scheduling mode has been proposed to coordinate the decentralized decision. Meanwhile, two contracts are designed for the new cooperative scheduling mode. On the basis of each contract, the bargaining model is used to discuss the scheduling game concerning different machines, constrains and objectives. During the bargaining process, a novel kind of scheduling problem marked by its product form objective is displayed. The product form is distinguished from the traditional linear weighted sum form. Targeting the novel problems, the heuristics are designed to find the solution. The HAPI with O(n3) complexity is one of the example of the heuristics. Some concepts including cooperation efficiency and sequence inversions are introduced to provide the quantified index for the evaluation of the coordination result. Numerical experiments results validated the effectiveness of the model.
4. By using the agent technology, a normalized bargaining process between players with bounded rationality and information are designed. The convergence and efficiency performance of the system are investigated by numerical experiments. The results show that the system can fit the limitation of objective conditions in actual supply chain production, which supports the feasibility of the model proposed in this dissertation.
引文
1. Christopher M. Logistics and supply chain management:creating value-adding networks[M]. Pearson education,2005.
2. Stevens G C. Successful supply-chain management[J]. Management Decision,1990,28(8).
3. Evans G N, Naim M M, Towill D R. Dynamic supply chain performance:assessing the impact of information systems[J]. Logistics Information Management,1993,6(4):15-25.
4. Farley G A. Discovering supply chain management:a roundtable discussion[J]. APICS-the performance advantage,1997,7(1):38-39.
5. Lee H L,Billington C. The evolution of supply-chain-management models and practice at Hewlett-Packard[J]. Interfaces,1995,25(5):42-63.
6.GB/T18354.2001.中华人民共和国国家标准物流术语[S].
7.丁俊发.中国物流业的经济学思考-纪念改革开放以来中国物流业发展30年[J].中国流通经济,2008,11：8-11.
8. Accenture. Why sustainable supply chain is good business[R]. http://www.accenture.com/us-en/outlook/Pages/outlook-journal-2012-why-sustainable-supply-chain-is-good-business.aspx
9. Li X, Wang Q. Coordination mechanisms of supply chain systems[J]. European journal of operational research,2007,179(1):1-16.
10. Xu K, Dong Y, Evers P T. Towards better coordination of the supply chain[J]. Transportation Research Part E:Logistics and Transportation Review,2001,37(1):35-54.
11. Giannoccaro I, Pontrandolfo P. Supply chain coordination by revenue sharing contracts[J]. International Journal of Production Economics,2004,89(2):131-139.
12. Lariviere M A. Supply chain contracting and coordination with stochastic demand[M]. Quan-titative models for supply chain management. Springer US,1999:233-268.
13. Sarmah S P, Acharya D, Goyal S K. Buyer vendor coordination models in supply chain man-agement[J]. European journal of operational research,2006,175(1):1-15.
14. Malone T W, Crowston K. The interdisciplinary study of coordination[J].ACM Computing Surveys,1994,26(1):87-119.
15. 赵天智、金以慧.基于依赖关系的供应链优化协调[J].计算机集成制造系统,2004,10：929-933.
16. Tsay A A, Nahmias S, Agrawal N. Modeling supply chain contracts:A review[J]. International Series In Operations Research And Management Science,1999:299-336.
17. 赵天智.金以慧.供应链调控机制[J].清华大学学报(自然科学版),2001.41(10)：123一126.
18. D. J. Thomas. P. M. Griftin. Coordinated supply chain management[J].European Journal of Operational Research.1996.94:1-15.
19. 杨德礼,郭琼,何勇等.供应链契约研究进展[J].管理学报.2006.3：117-125.
20. Cachon G P. Lariviere M A. Supply chain coordination with revenue-sharing contracts: strengths and limitations[J]. Management science.2005.51(1):30-44.
21. Cachon G P. Competitive supply chain inventory management[J]. International Series In Op-erations Research And Management Science,1999:111-146.
22. Cachon G P. Supply chain coordination with contracts[J]. Handbooks in operations research and management science,2003,11:229-340.
23. Michael Hammer. Reengineering work:Don't automate, obliterate[J]. Harvard Business Re-view,1990,68(4):104-112.
24. Han M, Ling H. BPR for supply chain management[J]. Logistics Technology.2003,9:34-37.
25. Li J F, Chen Y. Cui X S. The strategy based on game theory for cross-organizational business process reengineering in supply chain[J]. WSEAS Transactions on Computers,2008,7(6): 579-588.
26. Gimenez C, van der Vaart T. van Donk D P. Supply chain integration and performance:the moderating effect of supply complexity[J]. International Journal of Operations & Production Management,2012,32(5):583-610.
27. Chen Z L, Vairaktarakis G L. Integrated scheduling of production and distribution opera-tions[J]. Management Science,2005,51(4):614-628.
28. Lee H L, Padmanabhan V, Whang S. Information distortion in a supply chain:the bullwhip effect[J]. Management science,1997.43(4):546-558.
29. Lee H L, Padmanabhan V. Whang S. The Bullwhip Effect In Supply Chains[J]. Sloan manage-ment review,1997,38(3):93-102.
30. Garcia Salcedo C A, Ibeas Hernandez A, Vilanova R, et al. Inventory control of supply chains Mitigating the bullwhip effect by centralized and decentralized Internal Model Control ap-proaches[J]. European Journal of Operational Research,2011,224(2):261-272.
31. Chen L, Lee H L. Bullwhip effect measurement and its implications[J]. Operations Research, 2012,60(4):771-784.
32. Yu Z, Yan H, Cheng T C E. Benefits of information sharing with supply chain partnerships[J]. Industrial management & Data systems,2001,101(3):114-121.
33. Lee H L, So K C, Tang C S. The value of information sharing in a two-level supply chain[J]. Management science,2000,46(5):626-643.
34. Cachon G P, Fisher M. Supply chain inventory management and the value of shared informa-tion[J]. Management science,2000,46(8):1032-1048.
35. Lee H L, Whang S. Information sharing in a supply chain[J]. International Journal of Manu-facturing Technology and Management,2000,1(1):79-93.
36. Da Xu L. Information architecture for supply chain quality management[J]. International Jour-nal of Production Research,2011,49(1):183-198.
37. Vickery S K, Droge C, Setia P, et al. Supply chain information technologies and organizational initiatives:complementary versus independent effects on agility and firm performance[J]. In-ternational Journal of Production Research,2010,48(23):7025-7042.
38. von Neumann J, Morgenstern O. Theory of Games and Economic Behavior[M]. Princeton: Princeton University Press,1944.
39. Nash J F. Equilibrium points in n-person games[J]. Proceedings of the national academy of sciences,1950,36(1):48-49.
40. Nash J F. Non-cooperative games[J]. The Annals of Mathematics,1951,54(2):286-295.
41. Myerson, R B. Game Theory:Analysis of Conflict[M].Cambridge and London:Harvard Uni-versity Press,1991.
42. Cachon G P, Zipkin P H. Competitive and cooperative inventory policies in a two-stage supply chain[J]. Management science,1999,45(7):936-953.
43. Cachon G P. Stock wars:inventory competition in a two-echelon supply chain with multiple retailers[J]. Operations Research,2001,49(5):658-674.
44. Chen F, Federgruen A, Zheng Y S. Near-optimal pricing and replenishment strategies for a retail/distribution system[J]. Operations Research,2001,49(6):839-853.
45. Sterman J D. Misperceptions of feedback in dynamic decision making[J]. Organizational be-havior and human decision processes,1989,43(3):301-335.
46. Chen F. Decentralized supply chains subject to information delays[J]. Management Science, 1999,45(8):1076-1090.
47. Chen F, Samroengraja R. The stationary beer game[J]. Production and Operations Manage-ment,2000,9(1):19-30.
48. Kimbrough S O, Wu D J, Zhong F. Computers play the beer game:can artificial agents manage supply chains?[J]. Decision support systems,2002,33(3):323-333.
49. Norman B. Tutorials in Operations Research:Models. Methods, and Applications for Innova-tive Decision Making[M]. Informs.2006.
50. Esmaeili M. Aryanezhad M B. Zeephongsekul P. A game theory approach in seller-buyer supply chain[J], European Journal of Operational Research,2009,195(2):442-448.
51. Gu Q. Gao T. Shi L. Price decision analysis for reverse supply chain based on game theory[J]. Systems Engineering-Theory & Practice,2005,20(3):20-25.
52. Hennet J C. Arda Y. Supply chain coordination:A game-theory approach[J]. Engineering Applications of Artificial Intelligence,2008,21(3):399-405.
53. Cai G G, Zhang Z G, Zhang M. Game theoretical perspectives on dual-channel supply chain competition with price discounts and pricing schemes[J]. International Journal of Production Economics.2009,117(1):80-96.
54. Van Mieghem J A. Coordinating investment, production, and subcontracting[J]. Management Science,1999,45(7):954-971.
55. Reyniers D J, Tapiero C S. The delivery and control of quality in supplier-producer contracts[J]. Management Science.1995.41(10):1581-1589.
56. Chod J, Rudi N. Strategic investments, trading, and pricing under forecast updating[J]. Man-agement Science,2006.52(12):1913-1929.
57. Gerchak Y, Gupta D. On apportioning costs to customers in centralized continuous review inventory systems[J]. Journal of Operations Management,1991,10(4):546-551.
58. Mauleon A, Vannetelbosch V. Farsightedness and cautiousness in coalition formation games with positive spillovers[J]. Theory and Decision.2004,56(3):291-324.
59. Hartman B C, Dror M. Cost allocation in continuous review inventory models[J]. Naval Re-search Logistics (NRL).1996,43(4):549-561.
60. Nagarajan M, Sosic G.Game-theoretic analysis of cooperation among supply chain agents: Review and extensions[J]. European Journal of Operational Research,2008,187(3):719-745.
61. Nagarajan M, Bassok Y. Bargaining and alliances in supply chains[M]Consumer Driven Elec-tronic Transformation. Springer Berlin Heidelberg.2005:39-51.
62. Nagarajan M, Bassok Y. A bargaining framework in supply chains:The assembly problem[J]. Management Science.2008.54(8):1482-1496.
63. Slikker M, Van den Nouweland A. Social and economic networks in cooperative game the-ory[M]. Kluwer Academic Pub,2001.
64. Baker K R.Introduction to sequencing and scheduling[M]. New York:Wiley,1974.
65. Pinedo M L. Scheduling:theory, algorithms, and systems[M]. Springer,2012.
66. Graham R L. Lawler E L. Lenstra J K, et al. Optimization and approximation in deterministic sequencing and scheduling:a survey[J]. Annals of discrete mathematics.1979.5(2):287-326.
67.唐国春,张峰,罗守成,等.现代排序论[M].上海科学普及出版社.2003.
68.唐恒水,赵传立.排序印论[M].科学出版社.2002
69. Lenstra J K, Kan A H G R, Brucker P. Complexity of machine scheduling problems[J].Annals of discrete mathematics,1977,1:343-362.
70. Garey M R, Johnson D S, Sethi R. The complexity of flowshop and jobshop scheduling[J]. Mathematics of operations research,1976,1(2):117-129.
71. Chen B, Potts C N, Woeginger G J. A review of machine scheduling:Complexity, algorithms and approximability[J]. Handbook of combinatorial optimization,1998,3:21-169.
72. Lawler E L, Lenstra J K, Kan A H G R, et al. Sequencing and scheduling:Algorithms and complexity [J]. Handbooks in operations research and management science.1993,4:445-522.
73. Leung J Y T , Whitehead J. On the complexity of fixed-priority scheduling of periodic, real-time tasks[J]. Performance evaluation,1982,2(4):237-250.
74. Vaessens R J M. Generalized job shop scheduling:complexity and local search[M]. Eindhoven, The Netherlands:Eindhoven University of Technology,1995.
75. Blazewicz J, Lenstra J K, Kan A H G. Scheduling subject to resource constraints:classification and complexity[J]. Discrete Applied Mathematics,1983,5(1):11-24.
76. Hall N G, Potts C N. Supply chain scheduling:batching and delivery[J].Operations Research, 2003,51(4):566-584.
77. Agnetis A, Hall N G, Pacciarelli D. Supply chain scheduling:sequence coordination[J]. Dis-crete Applied Mathematics,2006,154:2044-2063.
78. Dawande M, Geismar H N, Hall N G, Sriskandarajah C. Supply chain scheduling:distribution systems[J].Production Oper. Management,2006,15:243-261.
79. Chen Z.-L, Hall N G. Supply Chain Scheduling:conflict and cooperation in assembly sys-tems[J]. Operations Research,2007,55(6):1072-1089.
80. Kreipl S, Pinedo M. Planning and scheduling in supply chains:an overview of issues in prac-tice[J]. Production and Operations management,2009,13(1):77-92.
81. Chauhan S S, Gordon V, Proth J M. Scheduling in supply chain environment[J]. European journal of operational research,2007,183(3):961-970.
82. Chauvet F, Levner E. Meyzin L K. et al. On-line scheduling in a surface treatment system[J]. European Journal of Operational Research.2000.120(2):382-392.
83. Duron C. Proth J M. Wardi Y. Insertion of a random task in a schedule:a real-time approach[J]. European journal of operational research,2005.164(1):52-63.
84. Gordon V. Proth J M. Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1-25.
85. Chauhan S S. Dolgui A. Proth J M. A continuous model for supply planning of assembly systems with stochastic component procurement times[J]. International Journal of Production Economics,2009,120(2):411-417.
86. Sawik T. Coordinated supply chain scheduling[J]. International journal of production eco-nomics,2009,120(2):437-451.
87. Choi T Y, Dooley K J, Rungtusanatham M. Supply networks and complex adaptive systems: control versus emergence[J]. Journal of operations management,2001,19(3):351-366.
88. Surana A, Kumara S. Greaves M. et al. Supply-chain networks:a complex adaptive systems perspective[J]. International Journal of Production Research,2005.43(20):4235-4265.
89. Pathak S D. Day J M. Nair A. et al. Complexity and Adaptivity in Supply Networks:Building Supply Network Theory Using a Complex Adaptive Systems Perspective[J]. Decision Sci-ences,2007,38(4):547-580.
90. Wycisk C, McKelvey B. Hülsmann M. "Smart parts" supply networks as complex adaptive systems:analysis and implications[J]. International Journal of Physical Distribution & Logis-tics Management,2008,38(2):108-125.
91. Li G, Ji P, Sun L Y. et al. Modeling and simulation of supply network evolution based on complex adaptive system and fitness landscape[J], Computers & Industrial Engineering,2009, 56(3):839-853.
92. Nilsson F, Darley V. On complex adaptive systems and agent-based modelling for improv-ing decision-making in manufacturing and logistics settings:Experiences from a packaging company[J].International Journal of Operations & Production Management,2006,26(12): 1351-1373.
93. Swaminathan J M, Smith S F, Sadeh N M. Modeling supply chain dynamics:A multiagent approach[J]. Decision sciences,1998.29(3):607-632.
94. Shen W. Agent-Based Systems for Intelligent Manufacturing:A State-of-the-Art Survey[J]. Knowledge and Information Systems, an International Journal,1999,1:129-156.
95. Fox M S, Barbuceanu M, Teigen R. Agent-oriented supply-chain management[J]. International Journal of Flexible Manufacturing Systems,2000,12(2):165-188.
96. 陈志祥.分布式多代理体系结构供应链协同技术研究[J].计算机集成制造系统,2005,11(2)：213-219.
97. 熊峰.供应链协同调度研究[D].武汉理工大学.2009.
98. 陈荣军,唐国春.平行机的供应链排序[J].系统科学与数学,200,2：274-282.
99. 陈荣军,唐国春.装配系统的供应链排序问题[J].数学的实践与认识,2011,41(18)：50-56.
100. 蔡政英,肖人彬,谭勇,等.不确定条件下循环供应链模糊自适应生产计划调度[J].控制与决策,2008,23(5)：525-529.
101.孙鑫,陈秋双,龙磊,等.三层供应链联合调度算法研究[J].计算机集成制造系统,2006,12(4)：590-595.
102. Hamers H, Borm P, Tijs S. On games corresponding to sequencing situations with ready times[J]. Mathematical Programming,1995,69(1-3):471-483.
103. Hamers H, Suijs J. Tijs S, et al. The split core for sequencing games[J]. Games and Economic Behavior,1996,15(2):165-176.
104. Hamers H,Klijn F, Suijs J. On the balancedness of multiple machine sequencing games[J]. European Journal of Operational Research,1999.119(3):678-691.
105. Curiel I.Pederzoli G, Tijs S. Sequencing games[J]. European Journal of Operational Research. 1989,40(3):344-351.
106. Curiel I, Potters J, Prasad R, et al. Cooperation in one machine scheduling[J]. Zeitschrift fur Operations Research,1993,38(2):113-129.
107. Curiel I, Hamers H, Klijn F. Sequencing games:a survey[M]. Chapters in Game Theory. Springer US,2004:27-50.
108. Wellman M P. A market-oriented programming environment and its application to distributed multicommodity flow problems[J]. Artificial Intelligence Res.1993,1:1-23.
109. Wellman M P.Market-oriented programming:Some early lessons[J]. Market-based control:a paradigm for distributed resource allocation,1996:74-95.
110. Wellman M P, Walsh W E, Wurman P R, et al. Auction protocols for decentralized schedul-ing[J]. Games and Economic Behavior,2001,35(1):271-303.
111. Feldman M,Tamir T.Approximate strong equilibrium in job scheduling games[M].Algorithmic Game Theory. Springer Berlin Heidelberg.2008:58-69.
112. Wang C, Xi Y. Modeling and analysis of single machine scheduling based on noncooperative game theory[J].Acta Automatica Sinica,2005,31(4):516.
113. Seredynski F. Competitive coevolutionary multi-agent systems:The application to mapping and scheduling problems[J]. Journal of Parallel and Distributed Computing.1997.47(1):39-57.
114. Seredynski F. Distributed scheduling using simple learning machines[J].European Journal of Operational Research,1998,107(2):401-413.
115. Seredynski F. Koronacki J, Janikow C Z. Distributed multiprocessor scheduling with decom-posed optimization criterion[J]. Future Generation Computer Systems.2001.17(4):387-396.
116. Agnetis A, Mirchandani P B, Pacciarelli D, et al. Scheduling problems with two competing agents [J]. Operations Research,2004,52(2):229-242.
117. Baker K R, Smith J C. A multiple-criterion model for machine scheduling[J], Journal of Scheduling,2003,6(1):7-16.
118. Borm P, Fiestras-Janeiro G, Harriers H, et al. On the convexity of games corresponding to sequencing situations with due dates[J], European Journal of Operational Research,2002. 136(3):616-634.
119. Cheng T C E. Ng C T,Yuan J J. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs[J], Theoretical Computer Science,2006,362(1):273-281.
120. Cheng T C E, Ng C T. Yuan J J. Multi-agent scheduling on a single machine with max-form criteria[J], European Journal of Operational Research,2008,188(2):603-609.
121. Karabati S. Kouvelis P, Kiran A S. Games, critical paths and assignment problems in permu-tation flow shops and cyclic scheduling flow line environments[Jl. Journal of the Operational Research Society,1992:241-258.
122. Lee W C, Chen S K, Chen C W, et al. A two-machine flowshop problem with two agents[J]. Computers & Operations Research,2011,38(1):98-104.
123. Kollias K. Non-preemptive coordination mechanisms for identical machine scheduling games[M].Structural Information and Communication Complexity. Springer Berlin Heidel-berg,2008:197-208.
124. Ye D, Zhang G. Coordination mechanisms for selfish parallel jobs scheduling[M]. Theory and Applications of Models of Computation. Springer Berlin Heidelberg,2012:225-236.
125. Lee K, Leung J Y T, Pinedo M L. Coordination mechanisms for parallel machine scheduling[J]. European Journal of Operational Research,2012,220(2):305-313.
126. Lang F,Fink A. Collaborative single and parallel machine scheduling by autonomous agents[C].Collaboration Technologies and Systems (CTS),2012 International Conference on. IEEE,2012:76-83.
127. Heydenreich B, Mǜller R, Uetz M. Decentralization and mechanism design for online machine scheduling[M]. Springer Berlin Heidelberg,2006.
128. Heydenreich B, Müller R. Uetz M. Games and mechanism design in machine scheduling-an introduction[J]. Production and Operations Management,2007,16(4):437-454.
129. Heydenreich B, Mǜller R, Uetz M. Mechanism design for decentralized online machine scheduling[J]. Operations research,2010,58(2):445-457.
130. Qing-song L J L, Ning-sheng W. Scheduling of Flexible Manufacturing System Based on Co-operative Game [J]. Journal of South China University of Technology (Natural Science Edi-tion),2007,9:023.
131. Koutsoupias E. Scheduling without payments[M]. Algorithmic Game Theory. Springer Berlin Heidelberg,2011:143-153.
132. Dewan P, Joshi S. Auction-based distributed scheduling in a dynamic job shop environmen[J]. International Journal of Production Research,2002,40(5):1173-1191.
133. Kutanoglu E, Wu S D. On combinatorial auction and Lagrangean relaxation for distributed resource scheduling[J]. IIE transactions,1999,31(9):813-826.
134. Hoefer M, Skopalik A. Stability and convergence in selfish scheduling with altruistic agents[M].Internet and Network Economics. Springer Berlin Heidelberg,2009:616-622.
135. Dobzinski S, Sundararajan M. On characterizations of truthful mechanisms for combinatorial auctions and scheduling[C].Proceedings of the 9th ACM conference on Electronic commerce. ACM,2008:38-47.
136. von Falkenhausen P, Harks T, Shoham Y, et al. Optimal cost sharing protocols for scheduling games[C].Proc.12th ACM Conf. Electronic Commerce.2011:285-294.
137. Leung J Y T, Pinedo M, Wan G. Competitive two-agent scheduling and its applications[J]. Operations Research,2010,58(2):458-469.
138. Christodoulou G, Koutsoupias E, Nanavati A. Coordination mechanisms[J]. Theoretical Com-puter Science,2009,410(36):3327-3336.
139. Mor B, Mosheiov G. Scheduling problems with two competing agents to minimize minmax and minsum earliness measures[J]. European Journal of Operational Research,2010,206(3): 540-546.
140. Nong Q Q, Cheng T C E, Ng C T. Two-agent scheduling to minimize the total cost[J]. European Journal of Operational Research,2011,215(1):39-44.
141. Immorlica N, Li L, Mirrokni V S. et al. Coordination mechanisms for selfish schedul-ing[M].Internet and Network Economics. Springer Berlin Heidelberg,2005:55-69.
142. Dürr C, Nguyen K T. Non-clairvoyant scheduling games[M].Algorithmic Game Theory. Springer Berlin Heidelberg.2009:135-146.
143. Calleja P, Estevez-Fernandez A, Borm P. et al. Job scheduling, cooperation, and control[J]. Operations Research Letters,2006.34(1):22-28.
144. Leon V J, Wu S D, Storer R H. Robust scheduling and game-theoretic control for short-term scheduling of job-shops[M].Operations Research in Production Planning and Control. Springer Berlin Heidelberg,1993:321-335.
145. Leon V J, Wu S D, Storer R H. A game-theoretic control approach for job shops in the presence of disruptions[J]. The International Journal of Production Research,1994,32(6):1451-1476.
146. Jiang W R, Lu C, Li F Z. A Game Theoretic Approach to Job Shop Scheduling[J]. Applied Mechanics and Materials,2011,66:960-965.
147. Teredesai T, Ramesh V C. A multi-agent mixed initiative system for real-time scheduling[C]. IEEE International Conference on Systems. Man, and Cybernetics,1998,1:439-444.
148. Ben-Arieh D. Chopra M. Evolutionary game-theoretic approach for shop floor control[C].IEEE International Conference on Systems, Man, and Cybernetics,1998,1:463-468.
149. Serafini P. Scheduling jobs on several machines with the job splitting property[J]. Operations Research,1996,44(4):617-628.
150. Lee C Y, Leung J Y T, Yu G. Two machine scheduling under disruptions with transportation considerations[J]. Journal of Scheduling,2006,9(1):35-48.
151. Bai S X. Competitive production scheduling:A two-firm.noncooperative finite dynamic game[J]. Annals of Operations Research,1996,68(1):1-31.
152. Zhou G, Jiang P, Huang G Q. A game-theory approach for job scheduling in networked man-ufacturing[J]. The International Journal of Advanced Manufacturing Technology,2009,41(9-10):972-985.
153. Zhou G, Xiao Z, Jiang P, et al. A game-theoretic approach to generating optimal process plans of multiple jobs in networked manufacturing[J]. International Journal of Computer Integrated Manufacturing.2010,23(12):1118-1132.
154. BiloV, Flammini M, Moscardelli L. Pareto approximations for the bicriteria scheduling prob-lem[J]. Journal of Parallel and Distributed Computing,2006,66(3):393-402.
155. Thang N K. NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games[J]. Theoretical Computer Science,2013,482:86-95.
156. Feng Q, Yu Z, Shang W. Pareto optimization of serial-batching scheduling problems on two agents[C]. IEEE International Conference on Advanced Mechatronic Systems (ICAMechS), 2011:165-168.
157. Christodoulou G, Gourves L, Pascual F. Scheduling selfish tasks:about the performance of truthful algorithms[M].Computing and Combinatorics. Springer Berlin Heidelberg,2007:187-197.
158. Brenner J, Schafer G. Cost sharing methods for makespan and completion time scheduling[M]. STACS 2007. Springer Berlin Heidelberg,2007:670-681.
159. Uhan N A. Algorithmic and game-theoretic perspectives on scheduling[D]. Massachusetts In-stitute of Technology,2008.
160. Nash J F. The bargaining problem[J]. Econometrica,1950,18:155-162.
161. Nash J F. Two person cooperative games[J]. Econometrica,1953,21:128-140.
162. Nash J. Non-cooperative games [J]. The Annals of Mathematics,1951,54(2):286-295.
163. Ahmad I, Ranka S, Khan S U. Using game theory for scheduling tasks on multi-core proces-sors for simultaneous optimization of performance and energy[C]. International Symposium on Parallel and Distributed Processing. IEEE,2008:1-6.
164. Yaacoub E, Dawy Z. Achieving the nash bargaining solution in OFDMA uplink using dis-tributed scheduling with limited feedback[J]. AEU-International Journal of Electronics and Communications,2011,65(4):320-330.
165. Gan X, Gu Y, Vairaktarakis G L, et al. A scheduling problem with one producer and the bar-gaining counterpart with two producers[M].Combinatorics, Algorithms, Probabilistic and Ex-perimental Methodologies. Springer Berlin Heidelberg,2007:305-316.
166. Agnetis A, De Pascale G, Pranzo M. Computing the Nash solution for scheduling bargaining problems[J]. International Journal of Operational Research,2009,6(1):54-69.
167. Agnetis A, Pacciarelli D, Pacifici A. Combinatorial models for multi-agent scheduling prob-lems[J]. Multiprocessor Scheduling,2007:21.
168. 金霁,顾燕红,唐国春.最大完工时问排序的两人合作博弈[J].上海第二工业大学学报,2011,28(1)：14-17.
169. Edgeworth F Y. Mathematical psychics:An essay on the application of mathematics to the moral sciences[M]. CK Paul,1881.
170. Zeuthen F. Problems of monopoly and economic warfare[M]. G. Routledge & sons, ltd.,1930.
171. Hicks J R. The theory of wages[M]. London:Macmillan,1932.
172. Roth A. Axiomatic Models of Bargaining Geophysics[M]. Cambridge, MA:Harvard Univer-sity Press,1979.
173. Binmore K, Rubinstein A. Wolinsky A. The Nash bargaining solution in economic mod-elling[J]. The RAND Journal of Economics.1986:176-188.
174. Carmichael F. A guide to game theory[M]. Prentice Hall:2005.
175. Fry T D. Armstrong R D. Rosen L D. A framework for single machine multiple objective sequencing research[J]. Omega.1989.17:595-607.
176. Stevenson M. Hendry L C. Kingsman B G. A review of production planning and control:the applicability of key concepts to the make-to-order industry[J]. International Journal of Produc-tion Research.2005,43(5):869-898.
177. Rajagopalan S. Make to order or make to stock:model and application[J]. Management Sci-ence,2002,48(2):241-256.
178. Maxwell W, Muckstadt J A, Thomas L J. et al. A modeling framework for planning and control of production in discrete parts manufacturing and assembly systems[J]. Interfaces,1983,13(6): 92-104.
179. Ghosh S, Gagnon R J. A comprehensive literature review and analysis of the design, balanc-ing and scheduling of assembly systems[J]. The International Journal of Production Research. 1989,27(4):637-670.
180. Van Brussel H. Planning and scheduling of assembly systems[J]. CIRP Annals-Manufacturing Technology,1990,39(2):637-644.
181. Boysen N, Fliedner M, Scholl A. A classification of assembly line balancing problems[J]. European Journal of Operational Research,2007.183(2):674-693.
182. Crowston W B, Wagner M, Williams J F. Economic lot size determination in multi-stage as-sembly systems[J]. Management Science,1973,19(5):517-527.
183. Williams J F. Note On the Optimality of Integer Lot Size Ratios in "Economic Lot Size Determination in Multi-Stage Assembly Systems" [J]. Management Science, 1982,28(11): 1341-1349.
184. Potts, C. N., Sevast'janov, S. V., Strusevich, V. A., Van Wassenhove. L. N., Zwaneveld, C. M. The two-stage assembly scheduling problem:complexity and approximation[J]. Operations Research,1995,43:346-355.
185. Al-Anzi F.S. Allahverdi, A. A self-adaptive differential evolution heuristic for two-stage as sembly scheduling problem to minimize maximum lateness with setup times[J]. European Journal of Operational Research,2007,182:80-94.
186. Allahverdi A, Al-Anzi F S. The two-stage assembly flowshop scheduling problem with bi-criteria of makespan and mean completion time[J]. The International Journal of Advanced Manufacturing Technology,2008,37(1-2):166-177.
187. Allahverdi A, Al-Anzi F S. Evolutionary heuristics and an algorithm for the two-stage assem-bly scheduling problem to minimize makespan with setup times[J]. International journal of production research,2006,44(22):4713-4735.
188. Allahverdi A, Al-Anzi F S. The two-stage assembly scheduling problem to minimize total completion time with setup times[J]. Computers & Operations Research.2009.36(10):2740-2747.
189. Al-Anzi F S, Allahverdi A. Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan[J]. Computers & Operations Research.2009.36(9):2682-2689.
190. Ding F Y, Cheng L. An effective mixed-model assembly line sequencing heuristic for just-in-time production systems[J]. Journal of Operations Management,1993,11(1):45-50.
191. Hariri A M A, Potts C N. A branch and bound algorithm for the two-stage assembly scheduling problem[J]. European Journal of Operational Research,1997,103(3):547-556.
192. Tozkapan A, Kirca o, Chung C S. A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem[J]. Computers & Operations Re-search,2003,30(2):309-320.
193. Park M W. Kim Y D. A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints[J]. European Journal of Operational Research. 2000,123(3):504-518.
194. Haouari M, Daouas T. Optimal scheduling of the 3-machine assembly-type flow shop[J]. Op-erations Research,1999,33(4):439-445.
195. Cheng T C E, Wang G. Scheduling the fabrication and assembly of components in a two-machine flowshop[J]. IIE transactions,1999.31(2):135-143.
196. Lee C Y, Cheng T C E, Lin B M T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem[J]. Management Science,1993.39(5):616-625.
197. Koulamas C, Kyparisis G J. A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines[J]. European journal of operational research,2007,182(2): 945-951.
198. Koulamas C, J Kyparisis G. The three-stage assembly flowshop scheduling problem[J]. Com-puters & Operations Research,2001,28(7):689-704.
199. Sung C S, Kim H A. A two-stage multiple-machine assembly scheduling problem for minimiz-ing sum of completion times[J]. International Journal of Production Economics,2008,113(2): 1038-1048.
200. Torabzadeh E, Zandieh M. Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop[J]. Advances in Engineering Software,2010,41(10):1238-1243.
201. Croce F D. Generalized pairwise interchanges and machine scheduling[J]. European Journal of Operational Research.1995.83:310-319.
202. Congram R K., Potts C N, van de Velde S. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem[J]. Informs Journal on Computing,2002, 14:52-67.
203. Eusuff M M, Lansey K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. J of Water Resources Planning and Management,2003,129(3):210-225.
204. Rahimi-Vahed A, Mirzaei A H. A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem[J]. Computers and Industrial Engineering, 2007,53(4):642-666.
205. Rahimi-Vahed, DangchiM,Ratiei H. A novel hybrid multi-objective shuffled frog-leaping al-gorithm for a bi-criteria permutation flow shop scheduling problem![J]. Int J of Advanced Man-ufacturing Technology,2009.41(11/12):1227-1239.
206. Papadimitriou C H. Kanellakis P C. Flowshop scheduling with limited temporary storage[J]. Journal of the ACM (JACM),1980,27(3):533-549.
207. Lu S H, Kumar P R. Distributed scheduling based on due dates and buffer priorities[J], Auto-matic Control. IEEE Transactions on.1991,36(12):1406-1416.
208. Pranzo M. Batch scheduling in a two-machine flow shop with limited buffer and sequence in-dependent setup times and removal times[J]. European Journal of Operational Research,2004, 153(3):581-592.
209. Menger C. Principles of economics[M]. Ludwig von Mises Institute,2007.
210. Shoham Y. Agent-oriented programming[J]. Artificial intelligence.1993,60(1):51-92.
2. Stevens G C. Successful supply-chain management[J]. Management Decision,1990,28(8).
3. Evans G N, Naim M M, Towill D R. Dynamic supply chain performance:assessing the impact of information systems[J]. Logistics Information Management,1993,6(4):15-25.
4. Farley G A. Discovering supply chain management:a roundtable discussion[J]. APICS-the performance advantage,1997,7(1):38-39.
5. Lee H L,Billington C. The evolution of supply-chain-management models and practice at Hewlett-Packard[J]. Interfaces,1995,25(5):42-63.
6.GB/T18354.2001.中华人民共和国国家标准物流术语[S].
7.丁俊发.中国物流业的经济学思考-纪念改革开放以来中国物流业发展30年[J].中国流通经济,2008,11：8-11.
8. Accenture. Why sustainable supply chain is good business[R]. http://www.accenture.com/us-en/outlook/Pages/outlook-journal-2012-why-sustainable-supply-chain-is-good-business.aspx
9. Li X, Wang Q. Coordination mechanisms of supply chain systems[J]. European journal of operational research,2007,179(1):1-16.
10. Xu K, Dong Y, Evers P T. Towards better coordination of the supply chain[J]. Transportation Research Part E:Logistics and Transportation Review,2001,37(1):35-54.
11. Giannoccaro I, Pontrandolfo P. Supply chain coordination by revenue sharing contracts[J]. International Journal of Production Economics,2004,89(2):131-139.
12. Lariviere M A. Supply chain contracting and coordination with stochastic demand[M]. Quan-titative models for supply chain management. Springer US,1999:233-268.
13. Sarmah S P, Acharya D, Goyal S K. Buyer vendor coordination models in supply chain man-agement[J]. European journal of operational research,2006,175(1):1-15.
14. Malone T W, Crowston K. The interdisciplinary study of coordination[J].ACM Computing Surveys,1994,26(1):87-119.
15. 赵天智、金以慧.基于依赖关系的供应链优化协调[J].计算机集成制造系统,2004,10：929-933.
16. Tsay A A, Nahmias S, Agrawal N. Modeling supply chain contracts:A review[J]. International Series In Operations Research And Management Science,1999:299-336.
17. 赵天智.金以慧.供应链调控机制[J].清华大学学报(自然科学版),2001.41(10)：123一126.
18. D. J. Thomas. P. M. Griftin. Coordinated supply chain management[J].European Journal of Operational Research.1996.94:1-15.
19. 杨德礼,郭琼,何勇等.供应链契约研究进展[J].管理学报.2006.3：117-125.
20. Cachon G P. Lariviere M A. Supply chain coordination with revenue-sharing contracts: strengths and limitations[J]. Management science.2005.51(1):30-44.
21. Cachon G P. Competitive supply chain inventory management[J]. International Series In Op-erations Research And Management Science,1999:111-146.
22. Cachon G P. Supply chain coordination with contracts[J]. Handbooks in operations research and management science,2003,11:229-340.
23. Michael Hammer. Reengineering work:Don't automate, obliterate[J]. Harvard Business Re-view,1990,68(4):104-112.
24. Han M, Ling H. BPR for supply chain management[J]. Logistics Technology.2003,9:34-37.
25. Li J F, Chen Y. Cui X S. The strategy based on game theory for cross-organizational business process reengineering in supply chain[J]. WSEAS Transactions on Computers,2008,7(6): 579-588.
26. Gimenez C, van der Vaart T. van Donk D P. Supply chain integration and performance:the moderating effect of supply complexity[J]. International Journal of Operations & Production Management,2012,32(5):583-610.
27. Chen Z L, Vairaktarakis G L. Integrated scheduling of production and distribution opera-tions[J]. Management Science,2005,51(4):614-628.
28. Lee H L, Padmanabhan V, Whang S. Information distortion in a supply chain:the bullwhip effect[J]. Management science,1997.43(4):546-558.
29. Lee H L, Padmanabhan V. Whang S. The Bullwhip Effect In Supply Chains[J]. Sloan manage-ment review,1997,38(3):93-102.
30. Garcia Salcedo C A, Ibeas Hernandez A, Vilanova R, et al. Inventory control of supply chains Mitigating the bullwhip effect by centralized and decentralized Internal Model Control ap-proaches[J]. European Journal of Operational Research,2011,224(2):261-272.
31. Chen L, Lee H L. Bullwhip effect measurement and its implications[J]. Operations Research, 2012,60(4):771-784.
32. Yu Z, Yan H, Cheng T C E. Benefits of information sharing with supply chain partnerships[J]. Industrial management & Data systems,2001,101(3):114-121.
33. Lee H L, So K C, Tang C S. The value of information sharing in a two-level supply chain[J]. Management science,2000,46(5):626-643.
34. Cachon G P, Fisher M. Supply chain inventory management and the value of shared informa-tion[J]. Management science,2000,46(8):1032-1048.
35. Lee H L, Whang S. Information sharing in a supply chain[J]. International Journal of Manu-facturing Technology and Management,2000,1(1):79-93.
36. Da Xu L. Information architecture for supply chain quality management[J]. International Jour-nal of Production Research,2011,49(1):183-198.
37. Vickery S K, Droge C, Setia P, et al. Supply chain information technologies and organizational initiatives:complementary versus independent effects on agility and firm performance[J]. In-ternational Journal of Production Research,2010,48(23):7025-7042.
38. von Neumann J, Morgenstern O. Theory of Games and Economic Behavior[M]. Princeton: Princeton University Press,1944.
39. Nash J F. Equilibrium points in n-person games[J]. Proceedings of the national academy of sciences,1950,36(1):48-49.
40. Nash J F. Non-cooperative games[J]. The Annals of Mathematics,1951,54(2):286-295.
41. Myerson, R B. Game Theory:Analysis of Conflict[M].Cambridge and London:Harvard Uni-versity Press,1991.
42. Cachon G P, Zipkin P H. Competitive and cooperative inventory policies in a two-stage supply chain[J]. Management science,1999,45(7):936-953.
43. Cachon G P. Stock wars:inventory competition in a two-echelon supply chain with multiple retailers[J]. Operations Research,2001,49(5):658-674.
44. Chen F, Federgruen A, Zheng Y S. Near-optimal pricing and replenishment strategies for a retail/distribution system[J]. Operations Research,2001,49(6):839-853.
45. Sterman J D. Misperceptions of feedback in dynamic decision making[J]. Organizational be-havior and human decision processes,1989,43(3):301-335.
46. Chen F. Decentralized supply chains subject to information delays[J]. Management Science, 1999,45(8):1076-1090.
47. Chen F, Samroengraja R. The stationary beer game[J]. Production and Operations Manage-ment,2000,9(1):19-30.
48. Kimbrough S O, Wu D J, Zhong F. Computers play the beer game:can artificial agents manage supply chains?[J]. Decision support systems,2002,33(3):323-333.
49. Norman B. Tutorials in Operations Research:Models. Methods, and Applications for Innova-tive Decision Making[M]. Informs.2006.
50. Esmaeili M. Aryanezhad M B. Zeephongsekul P. A game theory approach in seller-buyer supply chain[J], European Journal of Operational Research,2009,195(2):442-448.
51. Gu Q. Gao T. Shi L. Price decision analysis for reverse supply chain based on game theory[J]. Systems Engineering-Theory & Practice,2005,20(3):20-25.
52. Hennet J C. Arda Y. Supply chain coordination:A game-theory approach[J]. Engineering Applications of Artificial Intelligence,2008,21(3):399-405.
53. Cai G G, Zhang Z G, Zhang M. Game theoretical perspectives on dual-channel supply chain competition with price discounts and pricing schemes[J]. International Journal of Production Economics.2009,117(1):80-96.
54. Van Mieghem J A. Coordinating investment, production, and subcontracting[J]. Management Science,1999,45(7):954-971.
55. Reyniers D J, Tapiero C S. The delivery and control of quality in supplier-producer contracts[J]. Management Science.1995.41(10):1581-1589.
56. Chod J, Rudi N. Strategic investments, trading, and pricing under forecast updating[J]. Man-agement Science,2006.52(12):1913-1929.
57. Gerchak Y, Gupta D. On apportioning costs to customers in centralized continuous review inventory systems[J]. Journal of Operations Management,1991,10(4):546-551.
58. Mauleon A, Vannetelbosch V. Farsightedness and cautiousness in coalition formation games with positive spillovers[J]. Theory and Decision.2004,56(3):291-324.
59. Hartman B C, Dror M. Cost allocation in continuous review inventory models[J]. Naval Re-search Logistics (NRL).1996,43(4):549-561.
60. Nagarajan M, Sosic G.Game-theoretic analysis of cooperation among supply chain agents: Review and extensions[J]. European Journal of Operational Research,2008,187(3):719-745.
61. Nagarajan M, Bassok Y. Bargaining and alliances in supply chains[M]Consumer Driven Elec-tronic Transformation. Springer Berlin Heidelberg.2005:39-51.
62. Nagarajan M, Bassok Y. A bargaining framework in supply chains:The assembly problem[J]. Management Science.2008.54(8):1482-1496.
63. Slikker M, Van den Nouweland A. Social and economic networks in cooperative game the-ory[M]. Kluwer Academic Pub,2001.
64. Baker K R.Introduction to sequencing and scheduling[M]. New York:Wiley,1974.
65. Pinedo M L. Scheduling:theory, algorithms, and systems[M]. Springer,2012.
66. Graham R L. Lawler E L. Lenstra J K, et al. Optimization and approximation in deterministic sequencing and scheduling:a survey[J]. Annals of discrete mathematics.1979.5(2):287-326.
67.唐国春,张峰,罗守成,等.现代排序论[M].上海科学普及出版社.2003.
68.唐恒水,赵传立.排序印论[M].科学出版社.2002
69. Lenstra J K, Kan A H G R, Brucker P. Complexity of machine scheduling problems[J].Annals of discrete mathematics,1977,1:343-362.
70. Garey M R, Johnson D S, Sethi R. The complexity of flowshop and jobshop scheduling[J]. Mathematics of operations research,1976,1(2):117-129.
71. Chen B, Potts C N, Woeginger G J. A review of machine scheduling:Complexity, algorithms and approximability[J]. Handbook of combinatorial optimization,1998,3:21-169.
72. Lawler E L, Lenstra J K, Kan A H G R, et al. Sequencing and scheduling:Algorithms and complexity [J]. Handbooks in operations research and management science.1993,4:445-522.
73. Leung J Y T , Whitehead J. On the complexity of fixed-priority scheduling of periodic, real-time tasks[J]. Performance evaluation,1982,2(4):237-250.
74. Vaessens R J M. Generalized job shop scheduling:complexity and local search[M]. Eindhoven, The Netherlands:Eindhoven University of Technology,1995.
75. Blazewicz J, Lenstra J K, Kan A H G. Scheduling subject to resource constraints:classification and complexity[J]. Discrete Applied Mathematics,1983,5(1):11-24.
76. Hall N G, Potts C N. Supply chain scheduling:batching and delivery[J].Operations Research, 2003,51(4):566-584.
77. Agnetis A, Hall N G, Pacciarelli D. Supply chain scheduling:sequence coordination[J]. Dis-crete Applied Mathematics,2006,154:2044-2063.
78. Dawande M, Geismar H N, Hall N G, Sriskandarajah C. Supply chain scheduling:distribution systems[J].Production Oper. Management,2006,15:243-261.
79. Chen Z.-L, Hall N G. Supply Chain Scheduling:conflict and cooperation in assembly sys-tems[J]. Operations Research,2007,55(6):1072-1089.
80. Kreipl S, Pinedo M. Planning and scheduling in supply chains:an overview of issues in prac-tice[J]. Production and Operations management,2009,13(1):77-92.
81. Chauhan S S, Gordon V, Proth J M. Scheduling in supply chain environment[J]. European journal of operational research,2007,183(3):961-970.
82. Chauvet F, Levner E. Meyzin L K. et al. On-line scheduling in a surface treatment system[J]. European Journal of Operational Research.2000.120(2):382-392.
83. Duron C. Proth J M. Wardi Y. Insertion of a random task in a schedule:a real-time approach[J]. European journal of operational research,2005.164(1):52-63.
84. Gordon V. Proth J M. Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research[J]. European Journal of Operational Research,2002,139(1):1-25.
85. Chauhan S S. Dolgui A. Proth J M. A continuous model for supply planning of assembly systems with stochastic component procurement times[J]. International Journal of Production Economics,2009,120(2):411-417.
86. Sawik T. Coordinated supply chain scheduling[J]. International journal of production eco-nomics,2009,120(2):437-451.
87. Choi T Y, Dooley K J, Rungtusanatham M. Supply networks and complex adaptive systems: control versus emergence[J]. Journal of operations management,2001,19(3):351-366.
88. Surana A, Kumara S. Greaves M. et al. Supply-chain networks:a complex adaptive systems perspective[J]. International Journal of Production Research,2005.43(20):4235-4265.
89. Pathak S D. Day J M. Nair A. et al. Complexity and Adaptivity in Supply Networks:Building Supply Network Theory Using a Complex Adaptive Systems Perspective[J]. Decision Sci-ences,2007,38(4):547-580.
90. Wycisk C, McKelvey B. Hülsmann M. "Smart parts" supply networks as complex adaptive systems:analysis and implications[J]. International Journal of Physical Distribution & Logis-tics Management,2008,38(2):108-125.
91. Li G, Ji P, Sun L Y. et al. Modeling and simulation of supply network evolution based on complex adaptive system and fitness landscape[J], Computers & Industrial Engineering,2009, 56(3):839-853.
92. Nilsson F, Darley V. On complex adaptive systems and agent-based modelling for improv-ing decision-making in manufacturing and logistics settings:Experiences from a packaging company[J].International Journal of Operations & Production Management,2006,26(12): 1351-1373.
93. Swaminathan J M, Smith S F, Sadeh N M. Modeling supply chain dynamics:A multiagent approach[J]. Decision sciences,1998.29(3):607-632.
94. Shen W. Agent-Based Systems for Intelligent Manufacturing:A State-of-the-Art Survey[J]. Knowledge and Information Systems, an International Journal,1999,1:129-156.
95. Fox M S, Barbuceanu M, Teigen R. Agent-oriented supply-chain management[J]. International Journal of Flexible Manufacturing Systems,2000,12(2):165-188.
96. 陈志祥.分布式多代理体系结构供应链协同技术研究[J].计算机集成制造系统,2005,11(2)：213-219.
97. 熊峰.供应链协同调度研究[D].武汉理工大学.2009.
98. 陈荣军,唐国春.平行机的供应链排序[J].系统科学与数学,200,2：274-282.
99. 陈荣军,唐国春.装配系统的供应链排序问题[J].数学的实践与认识,2011,41(18)：50-56.
100. 蔡政英,肖人彬,谭勇,等.不确定条件下循环供应链模糊自适应生产计划调度[J].控制与决策,2008,23(5)：525-529.
101.孙鑫,陈秋双,龙磊,等.三层供应链联合调度算法研究[J].计算机集成制造系统,2006,12(4)：590-595.
102. Hamers H, Borm P, Tijs S. On games corresponding to sequencing situations with ready times[J]. Mathematical Programming,1995,69(1-3):471-483.
103. Hamers H, Suijs J. Tijs S, et al. The split core for sequencing games[J]. Games and Economic Behavior,1996,15(2):165-176.
104. Hamers H,Klijn F, Suijs J. On the balancedness of multiple machine sequencing games[J]. European Journal of Operational Research,1999.119(3):678-691.
105. Curiel I.Pederzoli G, Tijs S. Sequencing games[J]. European Journal of Operational Research. 1989,40(3):344-351.
106. Curiel I, Potters J, Prasad R, et al. Cooperation in one machine scheduling[J]. Zeitschrift fur Operations Research,1993,38(2):113-129.
107. Curiel I, Hamers H, Klijn F. Sequencing games:a survey[M]. Chapters in Game Theory. Springer US,2004:27-50.
108. Wellman M P. A market-oriented programming environment and its application to distributed multicommodity flow problems[J]. Artificial Intelligence Res.1993,1:1-23.
109. Wellman M P.Market-oriented programming:Some early lessons[J]. Market-based control:a paradigm for distributed resource allocation,1996:74-95.
110. Wellman M P, Walsh W E, Wurman P R, et al. Auction protocols for decentralized schedul-ing[J]. Games and Economic Behavior,2001,35(1):271-303.
111. Feldman M,Tamir T.Approximate strong equilibrium in job scheduling games[M].Algorithmic Game Theory. Springer Berlin Heidelberg.2008:58-69.
112. Wang C, Xi Y. Modeling and analysis of single machine scheduling based on noncooperative game theory[J].Acta Automatica Sinica,2005,31(4):516.
113. Seredynski F. Competitive coevolutionary multi-agent systems:The application to mapping and scheduling problems[J]. Journal of Parallel and Distributed Computing.1997.47(1):39-57.
114. Seredynski F. Distributed scheduling using simple learning machines[J].European Journal of Operational Research,1998,107(2):401-413.
115. Seredynski F. Koronacki J, Janikow C Z. Distributed multiprocessor scheduling with decom-posed optimization criterion[J]. Future Generation Computer Systems.2001.17(4):387-396.
116. Agnetis A, Mirchandani P B, Pacciarelli D, et al. Scheduling problems with two competing agents [J]. Operations Research,2004,52(2):229-242.
117. Baker K R, Smith J C. A multiple-criterion model for machine scheduling[J], Journal of Scheduling,2003,6(1):7-16.
118. Borm P, Fiestras-Janeiro G, Harriers H, et al. On the convexity of games corresponding to sequencing situations with due dates[J], European Journal of Operational Research,2002. 136(3):616-634.
119. Cheng T C E. Ng C T,Yuan J J. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs[J], Theoretical Computer Science,2006,362(1):273-281.
120. Cheng T C E, Ng C T. Yuan J J. Multi-agent scheduling on a single machine with max-form criteria[J], European Journal of Operational Research,2008,188(2):603-609.
121. Karabati S. Kouvelis P, Kiran A S. Games, critical paths and assignment problems in permu-tation flow shops and cyclic scheduling flow line environments[Jl. Journal of the Operational Research Society,1992:241-258.
122. Lee W C, Chen S K, Chen C W, et al. A two-machine flowshop problem with two agents[J]. Computers & Operations Research,2011,38(1):98-104.
123. Kollias K. Non-preemptive coordination mechanisms for identical machine scheduling games[M].Structural Information and Communication Complexity. Springer Berlin Heidel-berg,2008:197-208.
124. Ye D, Zhang G. Coordination mechanisms for selfish parallel jobs scheduling[M]. Theory and Applications of Models of Computation. Springer Berlin Heidelberg,2012:225-236.
125. Lee K, Leung J Y T, Pinedo M L. Coordination mechanisms for parallel machine scheduling[J]. European Journal of Operational Research,2012,220(2):305-313.
126. Lang F,Fink A. Collaborative single and parallel machine scheduling by autonomous agents[C].Collaboration Technologies and Systems (CTS),2012 International Conference on. IEEE,2012:76-83.
127. Heydenreich B, Mǜller R, Uetz M. Decentralization and mechanism design for online machine scheduling[M]. Springer Berlin Heidelberg,2006.
128. Heydenreich B, Müller R. Uetz M. Games and mechanism design in machine scheduling-an introduction[J]. Production and Operations Management,2007,16(4):437-454.
129. Heydenreich B, Mǜller R, Uetz M. Mechanism design for decentralized online machine scheduling[J]. Operations research,2010,58(2):445-457.
130. Qing-song L J L, Ning-sheng W. Scheduling of Flexible Manufacturing System Based on Co-operative Game [J]. Journal of South China University of Technology (Natural Science Edi-tion),2007,9:023.
131. Koutsoupias E. Scheduling without payments[M]. Algorithmic Game Theory. Springer Berlin Heidelberg,2011:143-153.
132. Dewan P, Joshi S. Auction-based distributed scheduling in a dynamic job shop environmen[J]. International Journal of Production Research,2002,40(5):1173-1191.
133. Kutanoglu E, Wu S D. On combinatorial auction and Lagrangean relaxation for distributed resource scheduling[J]. IIE transactions,1999,31(9):813-826.
134. Hoefer M, Skopalik A. Stability and convergence in selfish scheduling with altruistic agents[M].Internet and Network Economics. Springer Berlin Heidelberg,2009:616-622.
135. Dobzinski S, Sundararajan M. On characterizations of truthful mechanisms for combinatorial auctions and scheduling[C].Proceedings of the 9th ACM conference on Electronic commerce. ACM,2008:38-47.
136. von Falkenhausen P, Harks T, Shoham Y, et al. Optimal cost sharing protocols for scheduling games[C].Proc.12th ACM Conf. Electronic Commerce.2011:285-294.
137. Leung J Y T, Pinedo M, Wan G. Competitive two-agent scheduling and its applications[J]. Operations Research,2010,58(2):458-469.
138. Christodoulou G, Koutsoupias E, Nanavati A. Coordination mechanisms[J]. Theoretical Com-puter Science,2009,410(36):3327-3336.
139. Mor B, Mosheiov G. Scheduling problems with two competing agents to minimize minmax and minsum earliness measures[J]. European Journal of Operational Research,2010,206(3): 540-546.
140. Nong Q Q, Cheng T C E, Ng C T. Two-agent scheduling to minimize the total cost[J]. European Journal of Operational Research,2011,215(1):39-44.
141. Immorlica N, Li L, Mirrokni V S. et al. Coordination mechanisms for selfish schedul-ing[M].Internet and Network Economics. Springer Berlin Heidelberg,2005:55-69.
142. Dürr C, Nguyen K T. Non-clairvoyant scheduling games[M].Algorithmic Game Theory. Springer Berlin Heidelberg.2009:135-146.
143. Calleja P, Estevez-Fernandez A, Borm P. et al. Job scheduling, cooperation, and control[J]. Operations Research Letters,2006.34(1):22-28.
144. Leon V J, Wu S D, Storer R H. Robust scheduling and game-theoretic control for short-term scheduling of job-shops[M].Operations Research in Production Planning and Control. Springer Berlin Heidelberg,1993:321-335.
145. Leon V J, Wu S D, Storer R H. A game-theoretic control approach for job shops in the presence of disruptions[J]. The International Journal of Production Research,1994,32(6):1451-1476.
146. Jiang W R, Lu C, Li F Z. A Game Theoretic Approach to Job Shop Scheduling[J]. Applied Mechanics and Materials,2011,66:960-965.
147. Teredesai T, Ramesh V C. A multi-agent mixed initiative system for real-time scheduling[C]. IEEE International Conference on Systems. Man, and Cybernetics,1998,1:439-444.
148. Ben-Arieh D. Chopra M. Evolutionary game-theoretic approach for shop floor control[C].IEEE International Conference on Systems, Man, and Cybernetics,1998,1:463-468.
149. Serafini P. Scheduling jobs on several machines with the job splitting property[J]. Operations Research,1996,44(4):617-628.
150. Lee C Y, Leung J Y T, Yu G. Two machine scheduling under disruptions with transportation considerations[J]. Journal of Scheduling,2006,9(1):35-48.
151. Bai S X. Competitive production scheduling:A two-firm.noncooperative finite dynamic game[J]. Annals of Operations Research,1996,68(1):1-31.
152. Zhou G, Jiang P, Huang G Q. A game-theory approach for job scheduling in networked man-ufacturing[J]. The International Journal of Advanced Manufacturing Technology,2009,41(9-10):972-985.
153. Zhou G, Xiao Z, Jiang P, et al. A game-theoretic approach to generating optimal process plans of multiple jobs in networked manufacturing[J]. International Journal of Computer Integrated Manufacturing.2010,23(12):1118-1132.
154. BiloV, Flammini M, Moscardelli L. Pareto approximations for the bicriteria scheduling prob-lem[J]. Journal of Parallel and Distributed Computing,2006,66(3):393-402.
155. Thang N K. NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games[J]. Theoretical Computer Science,2013,482:86-95.
156. Feng Q, Yu Z, Shang W. Pareto optimization of serial-batching scheduling problems on two agents[C]. IEEE International Conference on Advanced Mechatronic Systems (ICAMechS), 2011:165-168.
157. Christodoulou G, Gourves L, Pascual F. Scheduling selfish tasks:about the performance of truthful algorithms[M].Computing and Combinatorics. Springer Berlin Heidelberg,2007:187-197.
158. Brenner J, Schafer G. Cost sharing methods for makespan and completion time scheduling[M]. STACS 2007. Springer Berlin Heidelberg,2007:670-681.
159. Uhan N A. Algorithmic and game-theoretic perspectives on scheduling[D]. Massachusetts In-stitute of Technology,2008.
160. Nash J F. The bargaining problem[J]. Econometrica,1950,18:155-162.
161. Nash J F. Two person cooperative games[J]. Econometrica,1953,21:128-140.
162. Nash J. Non-cooperative games [J]. The Annals of Mathematics,1951,54(2):286-295.
163. Ahmad I, Ranka S, Khan S U. Using game theory for scheduling tasks on multi-core proces-sors for simultaneous optimization of performance and energy[C]. International Symposium on Parallel and Distributed Processing. IEEE,2008:1-6.
164. Yaacoub E, Dawy Z. Achieving the nash bargaining solution in OFDMA uplink using dis-tributed scheduling with limited feedback[J]. AEU-International Journal of Electronics and Communications,2011,65(4):320-330.
165. Gan X, Gu Y, Vairaktarakis G L, et al. A scheduling problem with one producer and the bar-gaining counterpart with two producers[M].Combinatorics, Algorithms, Probabilistic and Ex-perimental Methodologies. Springer Berlin Heidelberg,2007:305-316.
166. Agnetis A, De Pascale G, Pranzo M. Computing the Nash solution for scheduling bargaining problems[J]. International Journal of Operational Research,2009,6(1):54-69.
167. Agnetis A, Pacciarelli D, Pacifici A. Combinatorial models for multi-agent scheduling prob-lems[J]. Multiprocessor Scheduling,2007:21.
168. 金霁,顾燕红,唐国春.最大完工时问排序的两人合作博弈[J].上海第二工业大学学报,2011,28(1)：14-17.
169. Edgeworth F Y. Mathematical psychics:An essay on the application of mathematics to the moral sciences[M]. CK Paul,1881.
170. Zeuthen F. Problems of monopoly and economic warfare[M]. G. Routledge & sons, ltd.,1930.
171. Hicks J R. The theory of wages[M]. London:Macmillan,1932.
172. Roth A. Axiomatic Models of Bargaining Geophysics[M]. Cambridge, MA:Harvard Univer-sity Press,1979.
173. Binmore K, Rubinstein A. Wolinsky A. The Nash bargaining solution in economic mod-elling[J]. The RAND Journal of Economics.1986:176-188.
174. Carmichael F. A guide to game theory[M]. Prentice Hall:2005.
175. Fry T D. Armstrong R D. Rosen L D. A framework for single machine multiple objective sequencing research[J]. Omega.1989.17:595-607.
176. Stevenson M. Hendry L C. Kingsman B G. A review of production planning and control:the applicability of key concepts to the make-to-order industry[J]. International Journal of Produc-tion Research.2005,43(5):869-898.
177. Rajagopalan S. Make to order or make to stock:model and application[J]. Management Sci-ence,2002,48(2):241-256.
178. Maxwell W, Muckstadt J A, Thomas L J. et al. A modeling framework for planning and control of production in discrete parts manufacturing and assembly systems[J]. Interfaces,1983,13(6): 92-104.
179. Ghosh S, Gagnon R J. A comprehensive literature review and analysis of the design, balanc-ing and scheduling of assembly systems[J]. The International Journal of Production Research. 1989,27(4):637-670.
180. Van Brussel H. Planning and scheduling of assembly systems[J]. CIRP Annals-Manufacturing Technology,1990,39(2):637-644.
181. Boysen N, Fliedner M, Scholl A. A classification of assembly line balancing problems[J]. European Journal of Operational Research,2007.183(2):674-693.
182. Crowston W B, Wagner M, Williams J F. Economic lot size determination in multi-stage as-sembly systems[J]. Management Science,1973,19(5):517-527.
183. Williams J F. Note On the Optimality of Integer Lot Size Ratios in "Economic Lot Size Determination in Multi-Stage Assembly Systems" [J]. Management Science, 1982,28(11): 1341-1349.
184. Potts, C. N., Sevast'janov, S. V., Strusevich, V. A., Van Wassenhove. L. N., Zwaneveld, C. M. The two-stage assembly scheduling problem:complexity and approximation[J]. Operations Research,1995,43:346-355.
185. Al-Anzi F.S. Allahverdi, A. A self-adaptive differential evolution heuristic for two-stage as sembly scheduling problem to minimize maximum lateness with setup times[J]. European Journal of Operational Research,2007,182:80-94.
186. Allahverdi A, Al-Anzi F S. The two-stage assembly flowshop scheduling problem with bi-criteria of makespan and mean completion time[J]. The International Journal of Advanced Manufacturing Technology,2008,37(1-2):166-177.
187. Allahverdi A, Al-Anzi F S. Evolutionary heuristics and an algorithm for the two-stage assem-bly scheduling problem to minimize makespan with setup times[J]. International journal of production research,2006,44(22):4713-4735.
188. Allahverdi A, Al-Anzi F S. The two-stage assembly scheduling problem to minimize total completion time with setup times[J]. Computers & Operations Research.2009.36(10):2740-2747.
189. Al-Anzi F S, Allahverdi A. Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan[J]. Computers & Operations Research.2009.36(9):2682-2689.
190. Ding F Y, Cheng L. An effective mixed-model assembly line sequencing heuristic for just-in-time production systems[J]. Journal of Operations Management,1993,11(1):45-50.
191. Hariri A M A, Potts C N. A branch and bound algorithm for the two-stage assembly scheduling problem[J]. European Journal of Operational Research,1997,103(3):547-556.
192. Tozkapan A, Kirca o, Chung C S. A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem[J]. Computers & Operations Re-search,2003,30(2):309-320.
193. Park M W. Kim Y D. A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints[J]. European Journal of Operational Research. 2000,123(3):504-518.
194. Haouari M, Daouas T. Optimal scheduling of the 3-machine assembly-type flow shop[J]. Op-erations Research,1999,33(4):439-445.
195. Cheng T C E, Wang G. Scheduling the fabrication and assembly of components in a two-machine flowshop[J]. IIE transactions,1999.31(2):135-143.
196. Lee C Y, Cheng T C E, Lin B M T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem[J]. Management Science,1993.39(5):616-625.
197. Koulamas C, Kyparisis G J. A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines[J]. European journal of operational research,2007,182(2): 945-951.
198. Koulamas C, J Kyparisis G. The three-stage assembly flowshop scheduling problem[J]. Com-puters & Operations Research,2001,28(7):689-704.
199. Sung C S, Kim H A. A two-stage multiple-machine assembly scheduling problem for minimiz-ing sum of completion times[J]. International Journal of Production Economics,2008,113(2): 1038-1048.
200. Torabzadeh E, Zandieh M. Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop[J]. Advances in Engineering Software,2010,41(10):1238-1243.
201. Croce F D. Generalized pairwise interchanges and machine scheduling[J]. European Journal of Operational Research.1995.83:310-319.
202. Congram R K., Potts C N, van de Velde S. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem[J]. Informs Journal on Computing,2002, 14:52-67.
203. Eusuff M M, Lansey K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. J of Water Resources Planning and Management,2003,129(3):210-225.
204. Rahimi-Vahed A, Mirzaei A H. A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem[J]. Computers and Industrial Engineering, 2007,53(4):642-666.
205. Rahimi-Vahed, DangchiM,Ratiei H. A novel hybrid multi-objective shuffled frog-leaping al-gorithm for a bi-criteria permutation flow shop scheduling problem![J]. Int J of Advanced Man-ufacturing Technology,2009.41(11/12):1227-1239.
206. Papadimitriou C H. Kanellakis P C. Flowshop scheduling with limited temporary storage[J]. Journal of the ACM (JACM),1980,27(3):533-549.
207. Lu S H, Kumar P R. Distributed scheduling based on due dates and buffer priorities[J], Auto-matic Control. IEEE Transactions on.1991,36(12):1406-1416.
208. Pranzo M. Batch scheduling in a two-machine flow shop with limited buffer and sequence in-dependent setup times and removal times[J]. European Journal of Operational Research,2004, 153(3):581-592.
209. Menger C. Principles of economics[M]. Ludwig von Mises Institute,2007.
210. Shoham Y. Agent-oriented programming[J]. Artificial intelligence.1993,60(1):51-92.