Many job shop scheduling approaches have been reported in the literature. Most of these approaches focus on the static scheduling problem, in which dynamical events such as the random job arrivals and machine breakdown/repair are ignored to make the scheduling problem more tractable. In addition most scheduling strategies are formulated with regards to a single performance criteria only, while the real job shop environment requires the meeting of several performance measures simultaneously. Moreover, most scheduling approaches reported in the literature also require that the job routes be fixed prior to scheduling. This assumption is considered unreasonable, as the additional flexibility of multiple job routes will undoubtedly improve scheduling performance.
New job shop scheduling algorithms and the enhancement of existing scheduling methods are the main thrusts of our research work. Our research work attempts to address the shortcomings listed above and more specifically includes all of the following issues generally neglected in the job shop scheduling literature:
back to V. Subramaniam Homepage
Oct 1999, by Subra