| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 101 === Among the ordinary flow shop, there are many temporary storage area, place the workpiece is waiting, but many of these do not exist in practice environments temporary area. Therefore derive blocking flowshop scheduling problem.
Flowshop scheduling research has been focused, with the recent changes in the processing environment, from a single factory slowly transformed into the trend of many factories, therefore, this study assigned for the process factory to join the factors and blocking constrain. The optimization criterion is the minimization of the maximum completion time, and use the harmony search algorithm (HS) as a solution based on adding NEH1 algorithm concepr to slove it. The computational result show that the study proposes a modified harmony search algorithm very excellent performance of the proposed.
|
|---|
