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 |
Fingerprint
ASJC Scopus subject areas
- Software
- Artificial Intelligence
- Applied Mathematics
- Theoretical Computer Science
Cite this
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 proceeding › Conference contribution
}
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 -