Scheduling No-Wait Flowshops Using a Hybrid Metaheuristic

• Main Authors: Wei-Ming Chao, 趙威銘
• Other Authors: 應國卿
• Format: Others
• Language: zh-TW
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/3q5mw5

碩士 === 國立臺北科技大學 === 工業工程與管理系 === 106 === In recent years, no-wait flowshop sccheduling producrion has been widlely applied in manufacturing. For instance, the food processing industry, the steelmaking process, the cementmaking process, and even the distribution of hospital emergency rooms and beds, is closely related to this kind of production method. Generally speaking, achieving good effectiveness and efficiency is a challenge in no-wait flow shop scheduling problem for this scheduling problem. So this paper proposes a hybrid metaheuristic called IGGA algorithm that can effectively solve this problem and optimization criterion is the minimization of the total completion time (TCT), Compared with four kinds of different heuristics, our IGGA heuristic can achieve greater effectiveness and better results on Taillard’s benchmarks. Experimental results show that the IGGA algorithm significantly outperforms the (Current and Future Idle Time, CFI) heuristic.