This research proposes a method to solve the adaptive, multi-objective job shop scheduling problem. Adaptive scheduling is necessary to deal with internal and external disruptions faced in real life manufacturing environments. Minimizing the mean tardiness for jobs to effectively meet customer due date requirements and minimizing mean flow time to reduce the lead time jobs spend in the system are optimized simultaneously. An asexual reproduction genetic algorithm with multiple mutation strategies is developed to solve the multi-objective optimization problem. The model is tested for single day and multi-day adaptive scheduling. Results are compared with those available in the literature for standard problems and using priority dispatching rules. The findings indicate that the genetic algorithm model can find good solutions within short computational time.
| Identifer | oai:union.ndltd.org:uky.edu/oai:uknowledge.uky.edu:gradschool_theses-1522 |
| Date | 01 January 2008 |
| Creators | Metta, Haritha |
| Publisher | UKnowledge |
| Source Sets | University of Kentucky |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | University of Kentucky Master's Theses |
Page generated in 0.0018 seconds