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

Ikno Kim, Junzo Watada

    Research output: Contribution to journalArticle

    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.

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

    Fingerprint

    Tabu search
    Computational methods
    Scheduling

    Keywords

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

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Bio-soft computational and tabu search methods for solving a multi-task project scheduling problem. / Kim, Ikno; Watada, Junzo.

    In: Journal of Computers, Vol. 7, No. 4, 2012, p. 1048-1055.

    Research output: Contribution to journalArticle

    @article{60207ed89e9a4d2ab8bbc62283f776b8,
    title = "Bio-soft computational and tabu search methods for solving a multi-task project scheduling problem",
    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.",
    keywords = "Adjacency matrix, Bio-soft computational method, Molecular encoding, Multitask project scheduling, Tabu search method",
    author = "Ikno Kim and Junzo Watada",
    year = "2012",
    doi = "10.4304/jcp.7.4.1048-1055",
    language = "English",
    volume = "7",
    pages = "1048--1055",
    journal = "Journal of Computers",
    issn = "1796-203X",
    publisher = "Academy Publisher",
    number = "4",

    }

    TY - JOUR

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

    AU - Kim, Ikno

    AU - Watada, Junzo

    PY - 2012

    Y1 - 2012

    N2 - 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.

    AB - 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.

    KW - Adjacency matrix

    KW - Bio-soft computational method

    KW - Molecular encoding

    KW - Multitask project scheduling

    KW - Tabu search method

    UR - http://www.scopus.com/inward/record.url?scp=84860283098&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84860283098&partnerID=8YFLogxK

    U2 - 10.4304/jcp.7.4.1048-1055

    DO - 10.4304/jcp.7.4.1048-1055

    M3 - Article

    AN - SCOPUS:84860283098

    VL - 7

    SP - 1048

    EP - 1055

    JO - Journal of Computers

    JF - Journal of Computers

    SN - 1796-203X

    IS - 4

    ER -