期刊文献+

蚁群算法求解非等同并行机调度问题的研究 被引量:1

Research for non-identical parallel machine schedule problem based on ant colony algorithm
下载PDF
导出
摘要 针对非等同并行机服务调度问题,以机场除冰调度服务为背景并以最小化旅客延误数为目标,提出了一种改进的蚁群算法。该算法根据调度模型的特点,充分考虑模型的约束条件并运用了一种改进的信息素更新策略求解并行机调度问题。仿真结果表明,改进的蚁群算法收敛速度快且结果较优,明显优于FIFO算法,适合求解非等同并行机调度问题。 Under the context of deicing in the airport and in order to solve a kind of non-identical parallel multi-machine schedule problem for minimizing the number of passengers delayed,an ant colony algorithm is suggested.Considering the characteristic of scheduling model and its’constraints,an improved pheromone update strategy is developed.The result is superior to that of traditional FIFO algorithm,indicates that the improved ant colony algorithm is valid and can fit for non-identical parallel multi-machine schedule problem.
出处 《计算机工程与应用》 CSCD 2012年第29期225-229,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.60879020) 对外经济贸易大学研究生科研创新基金(No.A201003006)
关键词 非等同并行机 现代服务业 蚁群算法 服务调度 non-identical parallel machine schedule modem service ant colony algorithm schedule problem
  • 相关文献

参考文献18

  • 1Moore J M.An n job, one machine sequencing algo- rithra for minimizing the number of late jobs[J].Man- agement Science, 1968,15( 1 ) : 102-109.
  • 2Baptiste RAn O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs[J].Operations Research, 1996,23( 1 ) : 1-14.
  • 3沈灏,杨启帆.两台机器及时完工工件数最大化问题的近似算法[J].高校应用数学学报(A辑),2003,18(2):207-212. 被引量:7
  • 4Lin B M T, Lu C Y, Shyu S J,et al.Development of new features of ant colony optimization for flowshop scheduling[J].Production Economics, 2008, 112 (1) : 742-755.
  • 5Gajpal Y, Rajendran C.An antcolony optimization algo- rithm for minimizing the completion time variance of jobs in flowshops[J].Production Economics, 2006, 101(1):259-272.
  • 6吴春辉,周水银.并行多机加权成套订单数极大化的混合遗传算法[J].系统工程理论与实践,2006,26(11):125-129. 被引量:5
  • 7亓凌,杨建栋,李保,于涵诚.基于自适应蚁群算法的柔性作业车间调度问题[J].机电工程,2010,27(2):46-49. 被引量:6
  • 8马军,李薇.求解作业车间调度问题的改进蚁群算法[J].统计与决策,2010,26(13):29-31. 被引量:2
  • 9Huang S H, Lin P C.A modified ant colony optimization algorithm for multitem inventory routing problems with demand uncertainty[J].Transportation Research, 2010, 46 (1) :598-611.
  • 10Baptiste EPolynomial time algorithms for minimizing the weighted number of late jobs on a single ma- chine with equal processing times[J].Joumal of Sched- uling, 1999,2 (6).

二级参考文献36

共引文献16

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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