An interactive method for the bi-objective resource-constrained project scheduling

摘要

In this paper, we propose an interactive method to solve a bi-objective resource-constrained project scheduling problem. The method is based on a double tabu search technique and generates a representative set of potentially efficient solutions to be considered in the scheduling of operations. The method proceeds in two steps. In the first step, the tabu mode, provides a good assignment of resources; in the second step, the tabu floating task, reschedules the tasks to obtain efficient solutions with regards the considered criteria. The approach is tested on a sample of problems ranging in size from 5 to 250 tasks and compared to other methods in the literature. The comparison shows the performance of the proposed approach.