A Hybrid VNS with TS for the Single Machine Scheduling Problem to Minimize the Sum of Weighted Tardiness of Jobs
暂无分享,去创建一个
[1] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..
[2] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[3] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[4] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[5] Chris N. Potts,et al. A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..
[6] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[7] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[8] Chris N. Potts,et al. Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..
[9] A. Volgenant,et al. Improved heuristics for the n-job single-machine weighted tardiness problem , 1999, Comput. Oper. Res..
[10] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[11] Chris N. Potts,et al. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..
[12] R. Storer,et al. A problem space algorithm for single machine weighted tardiness problems , 2003 .
[13] Furkan Kiraç,et al. A tabu search algorithm for the single machine total weighted tardiness problem , 2007, Eur. J. Oper. Res..