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

    Soft computing
    Job Shop Scheduling Problem
    Soft Computing
    Schedule
    Heuristic methods
    Combinatorial optimization
    Parallel Computation
    Heuristic Method
    Combinatorial Optimization Problem
    Metaheuristics
    DNA
    Molecules
    Job shop scheduling
    Computing

    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

    Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing. / Kim, Ikno; Watada, Junzo; Jeng, Don Jyh Fu.

    IEEE International Conference on Fuzzy Systems. 2009. p. 1426-1431 5277148.

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

    Kim, I, Watada, J & Jeng, DJF 2009, Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing. in IEEE International Conference on Fuzzy Systems., 5277148, pp. 1426-1431, 2009 IEEE International Conference on Fuzzy Systems, Jeju Island, 09/8/20. https://doi.org/10.1109/FUZZY.2009.5277148
    Kim I, Watada J, Jeng DJF. Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing. In IEEE International Conference on Fuzzy Systems. 2009. p. 1426-1431. 5277148 https://doi.org/10.1109/FUZZY.2009.5277148
    Kim, Ikno ; Watada, Junzo ; Jeng, Don Jyh Fu. / Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing. IEEE International Conference on Fuzzy Systems. 2009. pp. 1426-1431
    @inproceedings{cf95de92ac084a3aa8fef62bccf2aaa9,
    title = "Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing",
    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.",
    author = "Ikno Kim and Junzo Watada and Jeng, {Don Jyh Fu}",
    year = "2009",
    doi = "10.1109/FUZZY.2009.5277148",
    language = "English",
    isbn = "9781424435975",
    pages = "1426--1431",
    booktitle = "IEEE International Conference on Fuzzy Systems",

    }

    TY - GEN

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

    AU - Kim, Ikno

    AU - Watada, Junzo

    AU - Jeng, Don Jyh Fu

    PY - 2009

    Y1 - 2009

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

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

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

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

    U2 - 10.1109/FUZZY.2009.5277148

    DO - 10.1109/FUZZY.2009.5277148

    M3 - Conference contribution

    AN - SCOPUS:71249160094

    SN - 9781424435975

    SP - 1426

    EP - 1431

    BT - IEEE International Conference on Fuzzy Systems

    ER -