Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

E. G. Coffman, Jr., G. S. Lueker and A. H. G. Rinnooy Kan
Additional contact information
E. G. Coffman, Jr.: AT&T Bell Laboratories, Murray Hill, New Jersey 07974
G. S. Lueker: University of California, Irvine, California 92717
A. H. G. Rinnooy Kan: Econometric Institute, Erasmus University, 3000 DR, Rotterdam, The Netherlands

Management Science, 1988, vol. 34, issue 3, 266-290

Abstract: 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.

Keywords: programming: integer algorithms; heuristic (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.3.266 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:34:y:1988:i:3:p:266-290

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().