Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

We consider the so-called parallel and serial scheduling method for the classical resource-constrained project scheduling problem. Theoretical results on the class of schedules generated by each method are provided. Furthermore, an in-depth computational study is undertaken to investigate the relati...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 90; no. 2; pp. 320 - 333
Main Author Kolisch, Rainer
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 19.04.1996
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We consider the so-called parallel and serial scheduling method for the classical resource-constrained project scheduling problem. Theoretical results on the class of schedules generated by each method are provided. Furthermore, an in-depth computational study is undertaken to investigate the relationship of single-pass scheduling and sampling for both methods. It is shown that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling improves the performance of single-pass scheduling significantly, and that the parallel method cannot be generally considered as superior.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(95)00357-6