Minimizing the Makespan for Unrelated Parallel Machines

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: GUO, Yunsong, LIM, Andrew, RODRIGUES, Brian, YANG, Liang
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2007
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/556
https://doi.org/10.1142/S0218213007003175
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English