Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation |
| |
| Institution: | 1. Faculty of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran;2. Research Center for Operations Management, Department of Decision Sciences and Information Management, Faculty of Economics and Business, KU Leuven, BE-3000 Leuven, Belgium;1. Department of Mathematics, University of Osijek, Trg Ljudevita Gaja 6, Osijek, Croatia;2. Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
