Bio-soft computational and tabu search methods for solving a multi-task project scheduling problem

Ikno Kim, Junzo Watada

    Research output: Contribution to journalArticle


    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.

    Original languageEnglish
    Pages (from-to)1048-1055
    Number of pages8
    JournalJournal of Computers
    Issue number4
    Publication statusPublished - 2012



    • Adjacency matrix
    • Bio-soft computational method
    • Molecular encoding
    • Multitask project scheduling
    • Tabu search method

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this