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

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

0.00 Avg rating0 Votes
Article ID: iaor1999156
Country: Netherlands
Volume: 90
Issue: 2
Start Page Number: 320
End Page Number: 333
Publication Date: Apr 1996
Journal: European Journal of Operational Research
Authors:
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.