论文信息 - A New Enhanced-Dynasearch & TS for the Pickling-rolling Scheduling Problem: A New Enhanced-Dynasearch & TS for the Pickling-rolling Scheduling Problem - 字舞流文

A New Enhanced-Dynasearch & TS for the Pickling-rolling Scheduling Problem: A New Enhanced-Dynasearch & TS for the Pickling-rolling Scheduling Problem

Ren Zhao | Li-Xin Tang

[1] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[2] Lixin Tang,et al. Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem , 2006 .

[3] Roberto Tadei,et al. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem , 2004, Oper. Res. Lett..

[4] Chris N. Potts,et al. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[5] Jun Zhao,et al. A two-stage scheduling method for hot rolling and its application , 2009 .

[6] Michel Gendreau,et al. The hot strip mill production scheduling problem: A tabu search approach , 1998, Eur. J. Oper. Res..

[7] Lixin Tang,et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

[8] Eugeniusz Nowicki,et al. The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..