Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances

Rainer Kolisch, Arno Sprecher and Andreas Drexl

No 301, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel from Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre

Abstract: The paper describes an algorithm for the generation of a general class of precedence- and resource-constrained scheduling problems. Easy and hard 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 strong impact of the chosen parametric characterization of the problems is shown via an in-depth computational study. 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 huge amount of computational time.

Keywords: Project scheduling; precedence- and resource-constraints; nonpreemptive case; single-mode; multiple-modes; project generator; branch-and-bound methods; easy and hard instances (search for similar items in EconPapers)
Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/155395/1/manuskript_301.pdf (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:zbw:cauman:301

Access Statistics for this paper

More papers in Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel from Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().