Byung Soo Kim, Karunia Agung Mahardini, Wonchul Seo, Shiegheun Koh
This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence dependent setup times. We first present a new mixed integer programming formulation for the problem, after that, since the problem is NP-hard, we propose four heuristic solution procedures including genetic based algorithms to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment and compare the performances of the heuristics. © 2015, ICIC International.
Department of Industrial and Management Engineering, Incheon National University, 119 Academy-ro, Yeonsu-gu, Incheon, South Korea; Department of Industrial Engineering, De La Salle Catholic University, Kairagi I Kombos, Manado, Indonesia; Department of Systems Management and Engineering, Pukyong National University, Yongsoro 45, Namgu, Busan, 608-737, South Korea
