基于智能算法的双目标鲁棒性项目调度研究

doi:F 224

系统管理学报 ›› 2015, Vol. 24 ›› Issue (3): 379-388.DOI: F 224

基于智能算法的双目标鲁棒性项目调度研究

崔南方1，赵雁1，田文迪2

1. 华中科技大学管理学院，武汉 430074；2. 武汉纺织大学管理学院，武汉 430073

收稿日期:2013-12-14 修回日期:2014-03-17
作者简介:崔南方(1963-），男，教授，博士生导师。研究方向为项目调度与供应链管理等。 E-mail: nfcui@mail.hust.edu.cn
基金资助:
国家自然科学基金资助项目（71271097，71201119）

Bi-objective Robust Project Scheduling based on Intelligent Algorithms

CUI Nan-fang1, ZHAO Yan1, TIAN Wen-di2

1. School of Management，Huazhong University of Science and Technology，Wuhan 430074， China；2. School of Management，Wuhan Textile University，Wuhan 430074，China

Received:2013-12-14 Revised:2014-03-17

摘要/Abstract

摘要： 鲁棒性项目调度主要应对项目执行过程中可能出现的各种不确定因素，涉及到完工和计划2个方面，又称质量鲁棒性和解鲁棒性。为使项目既保证按时完工又能按计划执行以减少成本，以STC分散缓冲为基础提出了两种具体的鲁棒性指标，构建了双目标鲁棒性调度模型。并结合模拟退火和禁忌搜索算法，建立了二阶段智能求解方法，计算结果表明，该算法综合了两算法的优点，可得到比单算法更合理的项目计划。最后，仿真模拟项目计划的运行，实验结果说明，该方法所得计划在实际执行中具有较好的双鲁棒性，验证了计划的有效性和可行性。

关键词: 完工鲁棒性, 计划鲁棒性, 双目标规划

Abstract: Robust project scheduling, dealing with all sorts of uncertainties in project execution, includes two sides: makespan and plan stability, also called quality robustness and solution robustness. In order to ensure both the completion time and the stability of project plan for cost saving, two robust indicators are proposed based-on STC scattered buffer method, and a bi-objective robust scheduling model is set up. A two-stage intelligent algorithm involving both the simulated annealing and tabu search is proposed to solve the problem. The results show that the proposed algorithm integrates the advantages of the two algorithms, and obtains more reasonable project plans than a single algorithm. The project plans are tested by a simulation experiment, and the results confirm that plans generated by the algorithm are effective and feasible with regard to both the two sides of robustness.

Key words: makespan robustness, plan robustness, bi-objective programming

崔南方1，赵雁1，田文迪2. 基于智能算法的双目标鲁棒性项目调度研究[J]. 系统管理学报, 2015, 24(3): 379-388.

参考文献

[1] Wang J. Constraint-based schedule repair for product development projects with time-limited constraints [J]. International Journal of Production Economics, 2005, 95(3)：399-414.
[2] Herroelen W S, Leus R. Project scheduling under uncertainty: survey and research potentials[J]. European Journal of Operational Research, 2005, 165(2): 289-306.
[3] Herroelen W S, Leus R. The construction of stable project baseline schedules [J]. European Journal of Operational Research, 2004, 156 (3): 550-565.
[4] Herroelen W., Leus R. On the merits and pitfalls of critical chain scheduling [J]. Journal of Operations Management, 2001, 19(5): 559-577.
[5] Van de Vonder S, Demeulemeester E, Herroelen W, et al. The use of buffers in project management: the trade-off between stability and makespan [J]. Int. J. Production Economics, 2005, (97):227-240.
[6] Goldratt E M. Critical Chain [M]. New York: The North River Press, 1997.
[7] 彭武良，金敏力，徐皓. 基于差分进化的关键链项目调度方法[J]. 系统管理学报, 2013 ，22 (6): 855-860.
[8] Leus R. The generation of stable project plans[D]. Department of applied economics, Katholieke Universiteit Leuven, Belgium,2003.
[9] Van de Vonder S, Demeulemeester E, Herroelen W, et al.The trade-off between stability and makespan in resource-constrained project scheduling[J]. International Journal of Production Research 2006,44 (2) 215-236.
[10] Van de Vonder S., Demeulemeester,E. and Herroelen,W., Proactive heuristic procedures for robust project scheduling: An experimental analysis[J]. European Journal of Operational Research, 2008, 189(3): 723-733.
[[1]1] M.A.Al-Fawzana, Mohamed Haouari. A bi-objective model for robust resource-constrained project scheduling[J]. Int. J. Production Economics，2005,96: 175-187．
[12] Abbasi B, Shadrokh S and Arkat J. Bi-objective resource-constrained project scheduling with robustness and makespan criteri[J]. Applied Mathematics and Computation, 2006, 180, (1): 146-152.
[13] Lee J K, Kim Y D. Search heuristics for resource constrained project scheduling[J]. Journal of the Operational Research Society, 1996: 678-689.
[14] Baar T, Brucker P, Knust S. Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem[M]. Springer US, 1999.
[15] Thomas P R, Salhi S. A tabu search approach for the resource constrained project scheduling problem[J]. Journal of Heuristics, 1998, 4(2): 123-139.
[16] Gagnon M, d'Avignon G, Aouni B. Resource‐constrained project scheduling through the goal programming model: integration of the manager's preferences[J]. International Transactions in Operational Research, 2012, 19(4): 547-565.
[17] Boctor F F. Resource-constrained project scheduling by simulated annealing[J]. International Journal of Production Research, 1996, 34(8): 2335-2351.
[18] Bouleimen K, Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version[J]. European Journal of Operational Research, 2003, 149(2): 268-281.
[19] Khoshjahan Y, Najafi A A, Afshar-Nadjafi B. Resource constrained project scheduling problem with discounted earliness–tardiness penalties: Mathematical modeling and solving procedure[J]. Computers & Industrial Engineering, 2013, 66(2): 293-300.
[20] Hartmann S. A self-adapting genetic algorithm for project scheduling under resource constraints[J]. Naval Research Logistics (NRL), 2002, 49(5): 433-448.
[21] Diana S, Ganapathy L, Pundir A K. An Improved Genetic Algorithm for Resource Constrained Project Scheduling Problem[J]. International Journal of Computer Applications, 2013, 78.
[22] 刘士新, 王梦光, 唐加福. 一种求解资源受限工程调度问题的遗传算法, 系统工程学报,2002, 17(1): 1-7.
[23] Lambrechts O, Demeulemeester E, Herroelen W. A tabu search procedure for developing robust predictive project schedules[J]. International Journal of Production Economics, 2008, 111(2): 493-508.
[24] 李佳媛, 何正文. 基于资源缓冲的鲁棒性多模式项目调度优化[J]. 工业工程与管理, 2013, 18(3): 49-55.
[25] Deblaere F, Demeulemeester E, Herroelen W, et al. Robust resource allocation decisions in resource-constrained projects [J].Decision sciences, 2007, 38(1), 5 - 37.
[26] Tukel O I, Rom W O, Eksioglu S D. An investigation of buffer sizing techniques in critical chain scheduling[J]. European Journal of Operational Research, 2006, 172(2): 401-416.