|
|||||
|
|
| 禁忌搜索方法解最小化拖期任务数的并行多机调度问题 | |
| 引用本文： | 尹新,杨自厚. 禁忌搜索方法解最小化拖期任务数的并行多机调度问题[J]. 控制与决策, 1995, 0(6) |
| 作者姓名： | 尹新 杨自厚 |
| 作者单位： | 东北大学自动控制系 |
| 摘 要： | 禁忌搜索方法（ＴＳ）是一种将人工智能技术引入管理中的一种高于一般启发式算法的智能化“超启发式”算法，它能有效地解决大型组合优化问题。本文用ＴＳ方法解决最小化拖期任务数的并行多机调度问题，并同目前最好的启发式作了比较，大量实验表明了ＴＳ方法的有效性。 |
| 关 键 词： | 并行多机，拖期任务数，禁忌搜索 |
Tabu Search Method for Minimizing the Number of Tardy Jobs in Identical Machine Scheduling |
|
| Yin Xin, Yang Zihou. Tabu Search Method for Minimizing the Number of Tardy Jobs in Identical Machine Scheduling[J]. Control and Decision, 1995, 0(6) | |
| Authors: | Yin Xin Yang Zihou |
| Affiliation: | Northeastern University |
| Abstract: | Tabu Search(TS) is a metaheuristic viewed as an integration of management science and artificial intelligence, it is an efficient method for combinatorial optimization problem. In this paper, we solve parallel machine minimizing the number of tardy jobs problem using TS, and compare it to the best heuristic found so far, computational results show its efficiency. |
| Keywords: | identical parallel machines tardy jobs tabu search |
| 本文献已被 CNKI 等数据库收录！ | |