Flowshop manufacturing cell scheduling problems with rejection

• Main Authors: Chun-Han Chen, 陳軍翰
• Other Authors: 應國卿
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/8x466u

碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 100 === The Flowshop manufacturing cell scheduling problem (FMCSP) with sequence-dependent family setup times (SDFSTs) has become a key area in the field of scheduling. We want to discuss the FMCSPs with rejection because the company capacity is limited in the real word. We can not satisfy every customer. Therefore, we need to know how to choose the right orders, because if we can not finish the product before the customer’s deadline, the product will lose its value. Moreover, the customers will lose their confidence toward us. In this study, a harmony search algorithm was presented for this problem is to maximize total revenue. To validate the performance of the proposed approach, we use Harmony Search, Revised Harmony Search, Brute-Force Search to deal with small problem. On the other hand, to deal the big problem, we use HS and RHS to compare their efficiency. The computational results showed that the RHS significantly outperforms the original HS in big problems. It is believed that it can serve as a new benchmark approach for future research.