Loading [a11y]/accessibility-menu.js
Determining feasible operating schedules for a job shop scheduling problem based on bio-soft computing | IEEE Conference Publication | IEEE Xplore

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...Show More

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.
Date of Conference: 20-24 August 2009
Date Added to IEEE Xplore: 02 October 2009
ISBN Information:
Print ISSN: 1098-7584
Conference Location: Jeju, Korea (South)

References

References is not available for this document.