| 含释放时间的同类机问题的可变邻域搜索算法 |
| |
| 引用本文： | 李凯,靳鹏,张述初.含释放时间的同类机问题的可变邻域搜索算法[J].系统工程学报,2010,25(2). |
| |
| 作者姓名： | 李凯 靳鹏 张述初 |
| |
| 作者单位： | 合肥工业大学管理学院,安徽,合肥,230009;过程优化与智能决策教育部重点实验室,安徽,合肥,230009 |
| |
| 基金项目： | 国家自然科学基金，国家高技术研究发展计划(863计划)重点项目，合肥工业大学科学研究发展基金 |
| |
| 摘 要： | 研究了目标函数是最小化完成时间和的同类机调度问题,其中作业释放时间可能不同.此问题被证明是强NP-hard问题.为此问题构造了一种启发式算法HRS,进而以HRS算法求解结果为初始解构造了问题的可变邻域搜索算法HRS-VNS.大量的随机数据实验用于验证算法的性能和效率.
|
| 关 键 词： | 同类机 完成时间和 释放时间 可变邻域搜索 |
Variable neighborhood search algorithm for uniform parallel machine scheduling with release dates |
| |
| LI Kai,JIN Peng,ZHANG Shu-chu.Variable neighborhood search algorithm for uniform parallel machine scheduling with release dates[J].Journal of Systems Engineering,2010,25(2). |
| |
| Authors: | LI Kai JIN Peng ZHANG Shu-chu |
| |
| Institution: | LI Kai1,2,JIN Peng1,ZHANG Shu-chu1,2(1.School of Management,Hefei University of Technology,Hefei 230009,China,2.Key Laboratory of Process Optimization , Intelligent Decision-making,Ministry of Education,China) |
| |
| Abstract: | The uniform parallel machine scheduling problem with unequal release dates and minimizing total completion time is considered.This problem has been proved to be NP-hard in the strong sense.A new heuristic algorithm(HRS) is proposed and a variable neighborhood search approach(HRS-VNS) is constructed to improve the quality of the HRS solutions.The performance and efficiency of HRS and HRS-VNS are tested on a set of randomly generated instances.The results and analysis of experiments are also given. |
| |
| Keywords: | uniform parallel machine total completion times release date variable neighborhood search |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
