Artificial Bee Colony Algorithm for Solving Unrelated Parallel Machine Scheduling Problem with Earliness-Tardiness Cost

• Main Authors: Ruei-Jhe Syu, 許睿哲
• Other Authors: Gen-Han Wu
• Format: Others
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/tj664s

碩士 === 國立東華大學 === 運籌管理研究所 === 102 === Manufacturing industry is one of the important popular industries in Taiwan. With the progress of time, manufacturing capability and barrier have been increasingly improving. How to utilize the limited resources to obtain the remarkable effect is the anticipated goal. In this study, we consider order release time, distinct due date, earliness-tardiness cost and sequence-dependent setup time into the unrelated parallel machine problem. We use the concept of just in time for managing orders on the best sequence and completing orders accurately on due date in order to minimize cost. To minimize the objective of this problem, we proposed a mixed integer programming model and used meta-heuristic algorithm to solve it efficiently. The artificial bee colony algorithm is used for sequencing phase and managing orders on suitable sequence. The optimal timing algorithm is used for timetabling phase and managing orders on the best completion time. In order to understand the algorithms’ strengths and weaknesses, we mix artificial bee colony algorithm with optimal timing algorithm and design some scenarios to analyze numerical examples. The experiment results show the performance of MABC2 algorithm is better than MABC1 in the medium and large problems, but they have no difference in small case.