Scheduling unrelated parallel machines with ready times and setup times

• Main Authors: Feng-Yu Hsieh, 謝逢祐
• Other Authors: Chi-Wei Lin
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/17559995757919459720

碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 100 === We consider the problem of scheduling n jobs on m unrelated parallel machines with ready times and sequence and machine dependent setup times to minimize total weighted tardiness. We have presented a mixed integer programming (MIP) model that can find optimal solutions for the studied problem and an effective adapted meta-heuristic algorithm known as electromagnetism-like mechanism (EM) algorithm that can find optimal or near optimal solutions for the studied problem within a reasonable time. We have compared our proposed EM with two existing meta-heuristics, ant colony optimization (ACO) and tabu search (TS). Computational results show that the proposed EM outperforms ACO and TS in terms of total weighted tardiness for small problem instances. For large problem instances, the proposed EM can find comparable results with ACO and TS.