Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing

Ikno Kim, Junzo Watada, Don Jyh Fu Jeng

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Meta-heuristic methods, which are often used in order to deal with job shop scheduling problems, are also often applied to combinatorial optimization problems. On another front, bio-soft computing is a new way of computing associated with DNA molecules. It is a new massively parallel computation, compared to micro-soft computing. In this paper, a novel way of determining feasible operating schedules is proposed for a job shop scheduling problem, paying particular attention to machine sequences. This new study shows how the goal of deriving reliable solutions using bio-soft computing can be achieved, for more reliable solutions based on this new bio-soft computing approach. A sample of various types of job shop scheduling problems is selected and its feasible operating schedules are determined using the strengths of our proposed method.

    Original languageEnglish
    Title of host publicationIEEE International Conference on Fuzzy Systems
    Pages1426-1431
    Number of pages6
    DOIs
    Publication statusPublished - 2009
    Event2009 IEEE International Conference on Fuzzy Systems - Jeju Island
    Duration: 2009 Aug 202009 Aug 24

    Other

    Other2009 IEEE International Conference on Fuzzy Systems
    CityJeju Island
    Period09/8/2009/8/24

      Fingerprint

    ASJC Scopus subject areas

    • Software
    • Artificial Intelligence
    • Applied Mathematics
    • Theoretical Computer Science

    Cite this

    Kim, I., Watada, J., & Jeng, D. J. F. (2009). Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing. In IEEE International Conference on Fuzzy Systems (pp. 1426-1431). [5277148] https://doi.org/10.1109/FUZZY.2009.5277148