A parallel complete anytime procedure for project scheduling under multiple resource constraints

作者：Zamani Reza^*

来源：International Journal of Advanced Manufacturing Technology, 2010, 50(1-4): 353-362.

DOI：10.1007/s00170-009-2483-z

• Anytime search
• Implicit enumeration
• Heuristic
• Project scheduling
• Branch-and-bound

This paper presents an effective parallel complete anytime procedure for the resource-constrained project scheduling problem. The procedure finds a sequence of solutions in which every solution improves the previous one. To accelerate the convergence of the sequence to the optimal solution, the procedure simultaneously works in the forward and backward directions. While in the forward direction, it solves the problem at hand; in the backward direction, it solves its mirror problem. Performing simultaneously in the forward and backward directions exploits the power of double processors that are now available on most personal computers. The results of computational experiments on 2,040 benchmark instances are promising and indicate that, for many instances, a fast convergence to optimal solutions is obtained.

• 出版日期2010-9