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

Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

Author

Listed:
  • Rainer Kolisch
  • Arno Sprecher
  • Andreas Drexl

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstraße 40, 24098 Kiel, Germany)

Abstract

This paper addresses the issue of how to generate problem instances of controlled difficulty. It focuses on precedence- and resource-constrained (project) scheduling problems, but similar ideas may be applied to other network optimization problems. It describes a network construction procedure that takes into account a) constraints on the network topology, b) a resource factor that reflects the density of the coefficient matrix, and c) a resource strength, which measures the availability of resources. The strong impact of the chosen parametric characterization of the problems is shown via an in depth computational study. Instances for the single- and multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art (branch and bound) procedures. The results provided, demonstrate that the classical benchmark instances used by several researchers over decades belong to the subset of the very easy ones. In addition, it is shown that hard instances, being far more smaller in size than presumed in the literature, may not be solved to optimality even within a large amount of computation time.

Suggested Citation

  • Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1693-1703
    DOI: 10.1287/mnsc.41.10.1693
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.10.1693
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.41.10.1693?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
    ---><---

    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:41:y:1995:i:10:p:1693-1703. 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.