Minimizing the Makespan for Unrelated Parallel Machines

• المؤلفون الرئيسيون: GUO, Yunsong, LIM, Andrew, RODRIGUES, Brian, YANG, Liang
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2007
• الموضوعات: Makespan; unrelated parallel machines; simulated annealing; tabu search; squeaky wheel optimization; Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/556; https://doi.org/10.1142/S0218213007003175
• المؤسسة: Singapore Management University

In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results th...