节点文献

基于PSO-H优化算法的单机E/T调度问题

Common Due Date Scheduling Problem on Single Machine Based on PSO-H Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 周泓吴学静谭小卫

【Author】 ZHOU Hong, WU Xue-jing, TAN Xiao-wei (Faculty of Economy Management, Beijing Aeronautics and Astronautics University, Beijing100083, China)

【机构】 北京航空航天大学经济管理学院北京航空航天大学经济管理学院 北京100083北京100083

【摘要】 经典的粒子群优化算法是一个有效的寻找连续函数极值的方法。其在离散空间的应用还很不成熟。主要针对公共交货期下E/T(Earliness/Tardiness)指标的单机调度问题进行研究,并基于粒子群与启发式集成的优化算法(Particle Swarm Optimization integrated with Heuristic:PSO-H)对该问题进行求解。启发式信息由工件加工时间和拖期惩罚构成,它对算法的寻优性能有明显的改善。同时,采用OR-Library中的标准算例对该算法进行仿真实验,显示出理想的寻优结果。

【Abstract】 The classical Particle Swarm Optimization (PSO) is a powerful method to find the minimum for a function optimization problem, especially with a continuous solution space. So far, it is seldom used to solve those problems with discrete featuresThe problem of scheduling jobs on a single machine against common due dates with respect to earliness and tardiness (E/T) penalties was dealt. At the same time, a PSO strategy integrated with a kind of heuristic algorithm was proposed, where the heuristic information is composed of the processing time and tardiness penalty for each job. It is indicated that such strategy can significantly improve the performance of the solutions. Benchmark testing from OR-Library demonstrates that the algorithm is both effective and efficient in achieving satisfied solutions for scheduling problems with earliness and tardiness penalties.

【关键词】 粒子群启发式优化调度E/T
【Key words】 PSOheuristicoptimizationschedulingE/T
【基金】 国家自然科学基金(70371005,70521001);新世纪优秀人才支持计划
  • 【文献出处】 系统仿真学报 ,Journal of System Simulation , 编辑部邮箱 ,2007年09期
  • 【分类号】TP316
  • 【被引频次】1
  • 【下载频次】149
节点文献中: 

本文链接的文献网络图示:

本文的引文网络