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

Ikno Kim*, Junzo Watada, Don Jyh Fu Jeng

*この研究の対応する著者

    研究成果: Conference contribution

    抄録

    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.

    本文言語English
    ホスト出版物のタイトルIEEE International Conference on Fuzzy Systems
    ページ1426-1431
    ページ数6
    DOI
    出版ステータスPublished - 2009
    イベント2009 IEEE International Conference on Fuzzy Systems - Jeju Island
    継続期間: 2009 8 202009 8 24

    Other

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

    ASJC Scopus subject areas

    • ソフトウェア
    • 人工知能
    • 応用数学
    • 理論的コンピュータサイエンス

    フィンガープリント

    「Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル