Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
综述了用于排序和装箱问题启发式算法平均性能的渐近分析方法，介绍了相关关键结果，适合对算法平均性能分析感兴趣的读者。
Recently there has been considerable interest in the average-case performance of heuristics. This paper pursues that interest, where it concerns sequencing and packing problems. In particular, we survey the methods that have been used to obtain formal probabilistic analyses of heuristics for makespan scheduling and one-dimensional bin packing. In so doing, we present many of the key results in these research areas.