Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
From MaRDI portal
Publication:3779988
DOI10.1287/mnsc.34.3.266zbMath0638.90054OpenAlexW1985246949WikidataQ89223875 ScholiaQ89223875MaRDI QIDQ3779988
George S. Lueker, Alexander H. G. Rinnooy Kan, Edward G. jun. Coffman
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.3.266
packingsequencingone-dimensional bin packingmakespan schedulingaverage-case performance of heuristics
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, A probabilistic analysis of the next fit decreasing bin packing heuristic, A note on the average-case behavior of a simple differencing method for partitioning, FFD bin packing for item sizes with uniform distributions on \([0,\frac12\).], The modified differencing method for the set partitioning problem with cardinality constraints, Expected performance of the shelf heuristic for 2-dimensional packing, Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations, A note on posterior tight worst-case bounds for longest processing time schedules, Average performance of greedy heuristics for the integer knapsack problem., Packing problems, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Average-case analysis of cutting and packing in two dimensions, Performance of the LPT algorithm in multiprocessor scheduling, An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
