Average and worst-case analysis of heuristics for the maximum tardiness problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .
[2] Kenneth R. Baker,et al. Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .
[3] M. Fisher. Worst-Case Analysis of Heuristic Algorithms , 1980 .
[4] Bruce L. Golden,et al. A decision-theoretic framework for comparing heuristics , 1984 .
[5] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[6] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .
[7] C. N. Potts,et al. Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..
[8] Graham K. Rand,et al. Decision Systems for Inventory Management and Production Planning , 1979 .
[9] Graham McMahon,et al. On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..
[10] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..