论文信息 - Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines - 字舞流文

Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines

Gerhard J. Woeginger | Tjark Vredeveld | Johann Hurink | Tobias Brüggemann | G. Woeginger | J. Hurink | T. Brüggemann | T. Vredeveld

[1] Abraham P. Punnen,et al. A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[2] Johann Hurink,et al. Quality of move-optimal schedules for minimizing total weighted completion time , 2006, Oper. Res. Lett..

[3] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .

[4] Petra Schuurman,et al. Performance Guarantees of Local Search for Multiprocessor Scheduling , 2007, INFORMS J. Comput..

[5] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.