期刊文献+

效率异质型员工项目调度算法研究 被引量:1

Study on algorithm for project scheduling with heterogeneous efficiency workforce
下载PDF
导出
摘要 研究了员工具有异质效率、最小化项目工期的项目调度问题,并建立了相应的整数线性规划模型。为解决此NP-hard问题,提出了基于优先规则的启发式算法,其在每次迭代中根据优先约束和优先规则选择优先任务员工对以分配任务,直至所有任务都完成调度。通过应用启发式算法生成初始调度,选用交换邻域结构和插入邻域结构产生邻域调度,并使用改进的前向递归算法求解目标函数值,构造出混合模拟退火算法。数值实验显示该算法能快速准确地进行寻优。 Project scheduling with heterogeneous efficiency workforce to minimize project duration is considered,and the corresponding integer linear programming is presented.To solve the NP-hard problem,a priority rule-based heuristic is proposed,which selects the prior task-employee pair according to precedence constraints and priority rule to assign the task at each iteration until all tasks are scheduled.A Hybrid Simulated Annealing(HSA) can be constructed through applying the heuristic to generate initial schedule,choosing the swap neighborhood structure and insertion neighborhood structure to obtain neighbor schedule,and employing the revised forward recursion algorithm to compute objective function value.Numerical experiments are conducted to show that the proposed HSA performs well with respect to accuracy and efficiency of solution
出处 《计算机工程与应用》 CSCD 北大核心 2011年第13期18-21,62,共5页 Computer Engineering and Applications
基金 国家自然科学基金重点项目No.70631003 国家高技术研究发展计划(863计划)重点项目(No.2008AA042901)~~
关键词 项目调度 异质效率 启发式算法 模拟退火 优先约束 project seheduling heterogeneous efficiencies heuristic sirnulated annealing precedence constraims
  • 相关文献

参考文献7

  • 1Bellenguez-Morineau,Neron E.A branch-and-bound method for solving multi-skill project scheduling problem[J].RAIRO--Operations Research,2007,41 (2):155-170. 被引量:1
  • 2Alfares H K,Bailey J E.Integrated project task and mR-power scheduling[J].IIE Transactions,1997,29(9):711-717. 被引量:1
  • 3Bassett M.Aesigning projects to optimize the utilization of employees' time and expertise[J].Computers and Chemical Engineering,2000,24:1013-1021. 被引量:1
  • 4Alba E,Chicano J E.Software project management with GAs[J].Information Sciences,2007,177:2380-2401. 被引量:1
  • 5Ullman J D.NP-complete scheduling problems[J] ,Journal of Computar and System Sciences,1975,10:384-393. 被引量:1
  • 6Tavakkoli-Moghaddam R,Taheri F,Bazzazi M,et al.Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times end precedence constraints[J].Computers & Operations Research,2009,36:3224-3230. 被引量:1
  • 7Hall N G,Posner M E.Generating experimental data for cnmputational testing with machine scheduling applicatious[J].Operations Research,2001,49:854-865. 被引量:1

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部