带搬运机器人的job-shop问题的并行禁忌搜索算法

Parallel Tabu Search Scheduling Algorithm for Job-Shop with Transport Robot

针对带一台搬运机器人的job-shop调度问题,提出了一种并行禁忌搜索算法,目标是最小化最大完工时间。首先,充分利用问题的特点,构造2个启发式的初始排序。然后,利用这2个初始排序,使用禁忌搜索算法并行的搜索。在禁忌搜索算法的领域部分,先建立析取图模型,然后查找关键路径,再查找关键路径上的机床块和机器人块,在块上采取移动或交换的策略来建立领域。实验结果表明算法是有效的。

In this paper, scheduling problem of job-shop with a single transport robot is addressed. A parallel tabu search algorithm is presented to minimize the makespan. First, with the characteristic of the problem, two schedules are created as the initial solutions by using a heuristic. Then, the tabu search algorithm is used for parallel search. By this algorithm, a disjunctive graph model is established such that the critical path and the block are found. Then, a strategy of moving or changing on block is used for the neighborhood in the algorithm. Experimental results show that the algorithm is effective.