A Mixed-Mode Chromosome Representation for Scheduling a Flowshop Manufacturing Cell with Sequence Dependent Family Setup Times

• Main Authors: Tai, Pang-Hao, 戴邦豪
• Other Authors: Wu, Muh-Cherng
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/94172999864885854340

碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === This research is concerned with the scheduling of a flowshop manufacturing cell with sequence-dependent family setup times. A new chromosome representation scheme is proposed. Based on the new and a prior chromosome representation schemes, we develop four types of genetic algorithms (GAs) to solve the scheduling problem. These four GAs, respectively called GA-T, GA-N, GA-TN, GA-NT, are essentially based on the same solution evolutionary mechanism but different in using various chromosome representation schemes. Extensive experiment results indicate that the GA-TN outperform the other three ones in terms of solution quality. This finding shed light on a new track for improving genetic algorithms—developing new chromosome representation scheme, even with the same solution evolutionary mechanisms, might lead to better solution effectiveness