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

Ikno Kim, Junzo Watada

    研究成果: Article査読

    抄録

    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.

    本文言語English
    ページ(範囲)1048-1055
    ページ数8
    ジャーナルJournal of Computers
    7
    4
    DOI
    出版ステータスPublished - 2012

    ASJC Scopus subject areas

    • コンピュータ サイエンス(全般)

    フィンガープリント

    「Bio-soft computational and tabu search methods for solving a multi-task project scheduling problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル