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 language | English |
---|---|
Title of host publication | IEEE International Conference on Fuzzy Systems |
Pages | 1426-1431 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 2009 |
Event | 2009 IEEE International Conference on Fuzzy Systems - Jeju Island Duration: 2009 Aug 20 → 2009 Aug 24 |
Other
Other | 2009 IEEE International Conference on Fuzzy Systems |
---|---|
City | Jeju Island |
Period | 09/8/20 → 09/8/24 |
ASJC Scopus subject areas
- Software
- Artificial Intelligence
- Applied Mathematics
- Theoretical Computer Science