| 最小化加权绝对偏差的并行多机调度问题 |
| |
| 引用本文： | 尹新 官涛. 最小化加权绝对偏差的并行多机调度问题[J]. 东北大学学报(自然科学版), 1996, 17(5): 559-562 |
| |
| 作者姓名： | 尹新 官涛 |
| |
| 作者单位： | 东北大学自动控制系 |
| |
| 摘 要： | 用禁忌搜索算法（ＴＳ）求解带有最小化绝对偏差的并行多机调度问题，首先证明了它是一个ＮＰ－难题，然后用一个启发式作初始解，给出一个禁忌搜索算法，实验表明，禁忌搜索方法求解最小化加权绝对偏差问题可以获得最优解或近似最优解。
|
| 关 键 词： | 调度 禁忌搜索 完工时间 交货期 偏差 并行加工 |
Minimizing Weighted Absolute Lateness for Parallel Machine Schedule Problem |
| |
| Yin Xin,Guan Tao,Yang Zihou. Minimizing Weighted Absolute Lateness for Parallel Machine Schedule Problem[J]. Journal of Northeastern University(Natural Science), 1996, 17(5): 559-562 |
| |
| Authors: | Yin Xin Guan Tao Yang Zihou |
| |
| Abstract: | This paper is concerned with a parallel machine scheduling problem to minimize the absolute lateness using tabu search. First we prove that it is a NP hard problem,then give a tabu search algorithm using a heuristic as an initial solution. Experiments show that using tabu search, optimal or near optimal solutions can be obtained to the absolute lateness problem. |
| |
| Keywords: | scheduling absolute lateness tabu search heuristic. |
| 本文献已被 CNKI 维普 等数据库收录！ |
