A performance comparison of heuristics for the total weighted tardiness problem
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[2] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..
[3] David A. Jackson,et al. Dynamic programming : a practical introduction , 1992 .
[4] Ram V. Rachamadugu,et al. Accurate myopic heuristics for tardiness scheduling , 1984 .
[5] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[6] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[7] Chris N. Potts,et al. A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..
[8] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[9] Chris N. Potts,et al. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..
[10] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[11] Linus Schrage,et al. Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..