| Summary: | 碩士 === 國立交通大學 === 工業工程與管理系所 === 97 === This research investigates a dual flow shop scheduling problem, which is in the context of allowing cross-shop processing. The scheduling objective is to minimize the coefficient of variation of slack time, in which the slack time of a job denotes the difference between its due date and total processing time. This scheduling problem involves two decisions: route assignment (assigning jobs to shops) and job sequencing. We developed a genetic algorithm (GA) for making the route assignment decision, which is further varied by including various kinds of dispatching algorithms. These dispatching algorithms include single heuristic rules, combined dispatching rules, and evolutionary approach. Numeric experiments for comparing these scheduling algorithms are carried out. Experiment results indicate that none of the GAs could outperform the others in all scenarios. Yet, the GA equipped with the combined dispatching rules is relatively more robust, performing quite well in most scenarios.
|
|---|
