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

    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)

    Fingerprint Dive into the research topics of 'A molecular computational approach to solving a work centre sequence-oriented manufacturing problem of classical job shop scheduling'. Together they form a unique fingerprint.

  • Cite this