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.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[3]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[4]  P. Billard.  Séries de Fourier aléatoirement bornées, continues, uniformément convergentes , 1965 .

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[7]  L. Shepp.  Covering the circle with random ARCS , 1972 .

[8]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[9]  L. A. Shepp,et al.  Covering the line with random intervals , 1972 .

[10]  J. Durbin.  Distribution theory for tests based on the sample distribution function , 1973 .

[11]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[12]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[13]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[14]  W. Stout.  Almost sure convergence , 1974 .

[15]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[16]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[19]  Micha Hofri.  Two-Dimensional Packing: Expected Performance of Simple Level Algorithms , 1980, Inf. Control..

[20]  Greg N. Frederickson,et al.  Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..

[21]  Micha Hofri,et al.  A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[22]  R. Serfling.  Approximation Theorems of Mathematical Statistics , 1980 .

[23]  S. Karlin,et al.  A second course in stochastic processes , 1981 .

[24]  Walter Knödel,et al.  A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.

[25]  G. S. Lueker.  An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .

[26]  N. Karmarkar.  Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.

[27]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[29]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[30]  Richard Loulou,et al.  Probabilistic behaviour of optical bin-packing solutions , 1984 .

[31]  Richard Loulou,et al.  Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling , 1984, Math. Oper. Res..

[32]  Onno J. Boxma,et al.  A Probabilistic Analysis of the LPT Scheduling Rule , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

[33]  On the monotonicity of certain bin packing algorithms , 1984 .

[34]  Michael J. Magazine,et al.  Probabilistic Analysis of Bin Packing Heuristics , 1984, Oper. Res..

[35]  Edward G. Coffman,et al.  Expected Makespans for Largest-First Multiprocessor Scheduling , 1984, Performance.

[36]  Frank Thomson Leighton,et al.  Some unexpected expected behavior results for bin packing , 1984, STOC '84.

[37]  E. G. Coffman,et al.  A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors , 1984, Math. Oper. Res..

[38]  János Komlós,et al.  On optimal matchings , 1984, Comb..

[39]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[40]  Micha Hofri.  A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm , 1984, J. Algorithms.

[41]  Edward G. Coffman,et al.  On the Expected Relative Performance of List Scheduling , 1985, Oper. Res..

[42]  Oj Onno Boxma,et al.  A probabilistic analysis of multiprocessor list scheduling : the Erlang case , 1985 .

[43]  Richard M. Karp,et al.  FFD bin packing for item sizes with distributions on [0,1/2] , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[44]  G. S. Lueker,et al.  Probabilistic analysis of optimum partitioning , 1986, Journal of Applied Probability.

[45]  J. B. G. Frenk,et al.  A probabilistic analysis of the next fit decreasing bin packing heuristic , 1986 .

[46]  John L. Bruno,et al.  Probabilistic Bounds on the Performance of List Scheduling , 1986, SIAM J. Comput..

[47]  Frank Thomson Leighton,et al.  A provably efficient algorithm for dynamic storage allocation , 1986, STOC '86.

[48]  János Csirik,et al.  A probabilistic analysis of the dual bin packing problem , 1986 .

[49]  Frank Thomson Leighton,et al.  Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms , 1986, STOC '86.

[50]  Micha Hofri,et al.  A Stochastic Analysis of the NFD Bin-Packing Algorithm , 1986, J. Algorithms.

[51]  Peter W. Shor.  The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..

[52]  Catherine C. McGeoch.  Experimental analysis of algorithms , 1986 .

[53]  J. B. G. Frenk,et al.  The rate of convergence to optimality of the LPT rule , 1986, Discret. Appl. Math..

[54]  Wansoo T. Rhee,et al.  Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[55]  George S. Lueker.  A note on the average-case behavior of a simple differencing method for partitioning , 1987 .

[56]  Wansoo T. Rhee.  Optimal Bin Packing with Items of Random Sizes , 1988, Math. Oper. Res..

[57]  Wansoo T. Rhee,et al.  Some distributions that allow perfect packing , 1988, JACM.

[58]  Wansoo T. Rhee,et al.  Optimal Bin Packing with Items of Random Sizes III , 1989, SIAM J. Comput..