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

Arbeitspapier

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.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 301

Classification and Topics

• Classification: Management
• Subject: Project scheduling ; precedence- and resource-constraints ; nonpreemptive case ; single-mode ; multiple-modes ; project generator ; branch-and-bound methods ; easy and hard instances ; Projektmanagement ; Theorie

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Kolisch, Rainer ; Sprecher, Arno ; Drexl, Andreas
• Event: Veröffentlichung
• (who): Universität Kiel, Institut für Betriebswirtschaftslehre ; ZBW – Leibniz Information Centre for Economics
• (where): Kiel
• (when): 1992

Further information

• Handle: http://hdl.handle.net/10419/155395
• Last update: 10.03.2025, 11:41 AM CET