A Three-Phase GA Algorithm With An Operation-Sequence-Based Chromosome Representation For Scheduling Flexible Job Shops

• Main Authors: Huang, Chien-Han, 黃建翰
• Other Authors: Wu, Muh-Cherng
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/08071820030579638920

碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === This research is concerned with the scheduling of a flexible job-shop problem (called FJSP), which involves two sub-decisions: (1) operation-to-machine assignment (2) operation sequencing for each machine. Most prior studies proposed meta-heuristic algorithms for the FJSP problem. This research proposes a new solution representation (called Sop), which is intended to model a particular sequence for all operations. Given a particular Sop, by some heuristic rules, we can obtain its two corresponding sub-decisions; which in turn represents a particular scheduling solution. Based on the Sop representation, this research adopts the existing architecture of genetic algorithm (GA) and develops a meta-heuristic algorithm (called GA_ Sop) to solve the FJSP problem.