Using Instance Statistics to Determine the Lookahead Parameter Value in the ATC Dispatch Rule: Making a good heuristic better
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[2] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[3] Chris N. Potts,et al. A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..
[4] Thomas E. Morton,et al. Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .
[5] M. Selim Akturk,et al. A new lower bounding scheme for the total weighted tardiness problem , 1998, Comput. Oper. Res..
[6] A. Volgenant,et al. Improved heuristics for the n-job single-machine weighted tardiness problem , 1999, Comput. Oper. Res..
[7] Rui Henrique Alves. Europe: Looking for a New Model , 2004 .
[8] Michael Pinedo,et al. A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .
[9] C. Barbot. Low cost carriers, secondary airports and State aid: an economic assessment of the Charleroi affair , 2004 .
[10] Han Hoogeveen,et al. Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..
[11] Hermano Rodrigues,et al. Competitiveness and Public-Private Partnerships: Towards a More Decentralised Policy , 2004 .