港口的拖轮调度过程是一类带特殊工艺约束的并行多机调度问题。
The port tugboat operation scheduling is a kind of parallel machines scheduling problem with special process constraint.
本文用TS方法解决最小化拖期任务数的并行多机调度问题，并同目前最好的启发式作了比较，大量实验表明了TS方法的有效性。
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.
本文用TS方法解决最小化拖期任务数的并行多机调度问题，并同目前最好的启发式作了比较，大量实验表明了TS方法的有效性。
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.
应用推荐