IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v34y1988i3p266-290.html
   My bibliography  Save this article

Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

Author

Listed:
  • 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)

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.

Suggested Citation

  • E. G. Coffman, Jr. & G. S. Lueker & A. H. G. Rinnooy Kan, 1988. "Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics," Management Science, INFORMS, vol. 34(3), pages 266-290, March.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:3:p:266-290
    DOI: 10.1287/mnsc.34.3.266
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.3.266
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.3.266?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dell'Amico, Mauro & Iori, Manuel & Martello, Silvano & Monaci, Michele, 2006. "Lower bounds and heuristic algorithms for the ki-partitioning problem," European Journal of Operational Research, Elsevier, vol. 171(3), pages 725-742, June.
    2. Johnny C. Ho & Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres, 2019. "A note on posterior tight worst-case bounds for longest processing time schedules," 4OR, Springer, vol. 17(1), pages 97-107, March.
    3. Kohli, Rajeev & Krishnamurti, Ramesh & Mirchandani, Prakash, 2004. "Average performance of greedy heuristics for the integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 36-45, April.

    More about this item

    Keywords

    programming: integer algorithms; heuristic;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:34:y:1988:i:3:p:266-290. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.