A molecular computational approach to solving a work centre sequence-oriented manufacturing problem of classical job shop scheduling

Ikno Kim, Junzo Watada

    Research output: Contribution to journalArticle

    Abstract

    Classical job shop scheduling includes an intractable manufacturing scheduling problem. The problem is how to minimise the maximum manufacturing completion time in high variety and low volume requirements. Further, we have to consider work centre sequences for how all the given jobs are sequenced by work centre orders, meaning that it is an NP-hard problem. A number of different types of methods and algorithms have been proposed for solving this issue. In this article, we focused on molecular computational methods and biological techniques to propose a new algorithm. Our algorithm can be used to search all the feasible manufacturing schedules, and isolate the schedule with the truly minimised maximum manufacturing completion time.

    Original languageEnglish
    Pages (from-to)473-487
    Number of pages15
    JournalInternational Journal of Unconventional Computing
    Volume6
    Issue number6
    Publication statusPublished - 2010

    Fingerprint

    Computational methods
    Computational complexity
    Scheduling
    Job shop scheduling

    Keywords

    • Classical job shop scheduling
    • Feasible manufacturing scheduling
    • Molecular computational algorithm
    • Molecular encoding method
    • Work centre sequence-oriented manufacturing problem

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    @article{9c773de5465644de8f521c1fb4b4067b,
    title = "A molecular computational approach to solving a work centre sequence-oriented manufacturing problem of classical job shop scheduling",
    abstract = "Classical job shop scheduling includes an intractable manufacturing scheduling problem. The problem is how to minimise the maximum manufacturing completion time in high variety and low volume requirements. Further, we have to consider work centre sequences for how all the given jobs are sequenced by work centre orders, meaning that it is an NP-hard problem. A number of different types of methods and algorithms have been proposed for solving this issue. In this article, we focused on molecular computational methods and biological techniques to propose a new algorithm. Our algorithm can be used to search all the feasible manufacturing schedules, and isolate the schedule with the truly minimised maximum manufacturing completion time.",
    keywords = "Classical job shop scheduling, Feasible manufacturing scheduling, Molecular computational algorithm, Molecular encoding method, Work centre sequence-oriented manufacturing problem",
    author = "Ikno Kim and Junzo Watada",
    year = "2010",
    language = "English",
    volume = "6",
    pages = "473--487",
    journal = "International Journal of Unconventional Computing",
    issn = "1548-7199",
    publisher = "Old City Publishing",
    number = "6",

    }

    TY - JOUR

    T1 - A molecular computational approach to solving a work centre sequence-oriented manufacturing problem of classical job shop scheduling

    AU - Kim, Ikno

    AU - Watada, Junzo

    PY - 2010

    Y1 - 2010

    N2 - Classical job shop scheduling includes an intractable manufacturing scheduling problem. The problem is how to minimise the maximum manufacturing completion time in high variety and low volume requirements. Further, we have to consider work centre sequences for how all the given jobs are sequenced by work centre orders, meaning that it is an NP-hard problem. A number of different types of methods and algorithms have been proposed for solving this issue. In this article, we focused on molecular computational methods and biological techniques to propose a new algorithm. Our algorithm can be used to search all the feasible manufacturing schedules, and isolate the schedule with the truly minimised maximum manufacturing completion time.

    AB - Classical job shop scheduling includes an intractable manufacturing scheduling problem. The problem is how to minimise the maximum manufacturing completion time in high variety and low volume requirements. Further, we have to consider work centre sequences for how all the given jobs are sequenced by work centre orders, meaning that it is an NP-hard problem. A number of different types of methods and algorithms have been proposed for solving this issue. In this article, we focused on molecular computational methods and biological techniques to propose a new algorithm. Our algorithm can be used to search all the feasible manufacturing schedules, and isolate the schedule with the truly minimised maximum manufacturing completion time.

    KW - Classical job shop scheduling

    KW - Feasible manufacturing scheduling

    KW - Molecular computational algorithm

    KW - Molecular encoding method

    KW - Work centre sequence-oriented manufacturing problem

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

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

    M3 - Article

    AN - SCOPUS:79951740021

    VL - 6

    SP - 473

    EP - 487

    JO - International Journal of Unconventional Computing

    JF - International Journal of Unconventional Computing

    SN - 1548-7199

    IS - 6

    ER -