Very Large-Scale Neighborhoods with Performance Guarantees 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] Johann Hurink,et al. Quality of move-optimal schedules for minimizing total weighted completion time , 2006, Oper. Res. Lett..
[2] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .
[3] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[4] Gerhard J. Woeginger,et al. A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem , 2000, Math. Program..
[5] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[6] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[7] Petra Schuurman,et al. Performance Guarantees of Local Search for Multiprocessor Scheduling , 2007, INFORMS J. Comput..
[8] Tjark Vredeveld,et al. Local search for multiprocessor scheduling: how many moves does it take to a local optimum? , 2003, Oper. Res. Lett..
[9] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[10] Peter Brucker,et al. Improving Local Search Heuristics for Some Scheduling Problems-I , 1996, Discret. Appl. Math..
[11] Abraham P. Punnen,et al. A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..
[12] Peter Brucker,et al. Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..
[13] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..