Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, Japan

---

Abstract—This article presents a novel integrated method in which bio-soft computational and tabu search methods are both used to solve a multi-task project scheduling problem. In this scheduling problem, the main challenge is to determine the most reliable completion time. To solve this problem, we first use our proposed bio-soft computational method. Next, a tabu search method is used to verify the final results of the bio-soft computational method. The biosoft computational method includes molecular techniques, and the tabu search method is an intelligent optimization technique. Based upon this integrated method’s success solving a multi-task project scheduling problem, this article proposes that this method can help decision makers in their computational project scheduling.

Index Terms—Adjacency matrix, bio-soft computational method, molecular encoding, tabu search method, multitask project scheduling

[PDF]

Cite: Ikno Kim, Junzo Watada, "Bio-Soft Computational and Tabu Search Methods for Solving a Multi-Task Project Scheduling Problem," Journal of Computers vol. 7, no. 4, pp. 1048-1055, 2012.