关键链上可被部分替代的受限资源动态调度  

Dynamic Scheduling for Partially Substitutability Constrained Resource Based on Critical Chain

作　　者：杨琴[1] 李金奇[1] 廖斌[1] 

机构地区：[1]四川师范大学商学院,四川成都610101

出　　处：《工业工程》2013年第3期72-76,88,共6页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(71202166);四川省"十二五"规划资助项目(SC11C042);教育部人文社科青年基金资助项目(13YJC630202)

摘　　要：关键链上受限资源的优化调度,能有效提高系统运作效率,是关键链项目管理的重要研究方向之一。但现有研究主要针对资源能否更新,较少考虑资源的可替代性。针对此,研究了关键链上可被部分替代的受限资源调度问题,以达到提高资源利用率、降低成本等目的。采用α/β/γ三元组方法,将研究的问题描述为以最小化滞后时间和为目标,具有机器适用限制的并行异速机调度问题,并建立对应的数学模型;运用混合重调度策略和改进粒子群算法进行了算法设计;设计了仿真算例,并通过算法比较表明该方法在求解结果和问题求解规模上显著优于传统PSO、GA算法。An optimal schedule of constrained resource on the critical chain can effectively improve the operational efficiency of the system.This is one of the important research issues in critical chain project management.Existing research on constrained resource mainly focuses on updating of resources rather than on the substitutability of resources.Therefore,the scheduling of partially substitutability constrained resource is studied to improve resource utilization and cut down the expense etc.Firstly,the scheduling problem is described as the parallel allometric machines with machine eligibility restriction by a triplet.With the goal of minimizing tardiness,a mathematical model is established.Then,a hybrid rescheduling strategy is used with improved particle swarm optimization to build an algorithm.Finally,simulated examples are designed,by comparing with particle swarm optimization （PSO） and GA to demonstrate the feasibility and superiority of the solution.

关 键 词：关键链 部分替代 受限资源 动态调度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]