%0 Journal Article
%T Bio-Soft Computational and Tabu Search Methods for Solving a Multi-Task Project Scheduling Problem
%A Ikno Kim
%A Junzo Watada
%J Journal of Computers
%D 2012
%I Academy Publisher
%R 10.4304/jcp.7.4.1048-1055
%X 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 bio-soft 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.
%K adjacency matrix
%K bio-soft computational method
%K molecular encoding
%K tabu search method
%K multi-task project scheduling
%U http://ojs.academypublisher.com/index.php/jcp/article/view/5695