A heuristic algorithm to minimize the total completion time on the m-machine flowshop.

• Main Authors: Yu-heng Wan, 萬宇恆
• Other Authors: Wen-Chiung Lee
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/77758649675067999825

碩士 === 逢甲大學 === 統計與精算所 === 94 === Thesis this studied theme a scheduling problem with a heuristic algorithm to minimize the total completion time on the m-machine flowshop. There are many this kind of references in scheduling problem, the purpose is looking for minimize the total completion time, but there are actually few references that apply to m-machines. This thesis will be in case of m-machine, developing a new algorithm of performing to find out the approximate solution. The ones that differentiate do simulation in a situation that the job is great and the job is little. Perform algorithms to make comparative analysis with the others. We find that the result which perform the algorithm that in this paper put forward is good. So it is a pretty good algorithm.