A tabu-search algorithm for scheduling jobs with precedence constraints on parallel machines

摘要

A tabu-search algorithm for scheduling jobs with tree-formed precedence constraints on parallel machines is discussed in this paper. The structural characteristic of the problem is studied, which helps the searching procedure focus on “promising” neighboring schedules only, such that computing time can be effectively reduced. Experiment shows the algorithm is capable for solving medium or large-scaled problems within acceptable computing time.