×

Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. (English) Zbl 1107.90015

Eur. J. Oper. Res. 178, No. 2, 374-390 (2007); corrigendum ibid. 240, No. 2, 602 (2015).
Summary: A priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resource vacations, which are known in advance. A new concept called moving resource strength is developed to help identify project situations where activity splitting is likely to be beneficial during scheduling. The moving resource strength concept is implemented in priority rule-based heuristics to control activity splitting when scheduling. Multiple comparisons of the performance of combination of activity–mode priority rules used in the heuristics are provided. Computational experiments demonstrate the effectiveness of the heuristic in reducing project makespan, and minimizing activity splitting.

MSC:

90B35 Deterministic scheduling theory in operations research
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alcaraz, J.; Maroto, C.; Ruiz, R., Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms, Journal of the Operational Research Society, 54, 614-626 (2003) · Zbl 1095.90541
[2] Alvarez-Valdes, R., Tamarit, J.M., 1989. Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis. In: Slowinski, R., Węglarz, J. (Eds.), Advances in Project Scheduling, pp. 113-134.; Alvarez-Valdes, R., Tamarit, J.M., 1989. Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis. In: Slowinski, R., Węglarz, J. (Eds.), Advances in Project Scheduling, pp. 113-134.
[3] Boctor, F. F., Some efficient multi-heuristic procedures for resource-constrained project scheduling, European Journal of Operational Research, 49, 3-13 (1990) · Zbl 1403.90305
[4] Boctor, F. F., Heuristics for scheduling projects with resource restrictions and several resource-duration modes, International Journal of Production Research, 31, 11, 2547-2558 (1993)
[5] Boctor, F. F., A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes, European Journal of Operational Research, 90, 349-361 (1996) · Zbl 0916.90143
[6] Böttcher, J.; Drexl, A.; Kolisch, R.; Salewski, F., Project scheduling under partially renewable resource constraints, Management Science, 45, 543-559 (1999) · Zbl 1231.90178
[7] Bouleimen, K.; Lecocq, H., A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, European Journal of Operational Research, 149, 268-281 (2003) · Zbl 1040.90015
[8] Brucker, P.; Drexl, A.; Möhring, R.; Neumann, K.; Pesch, E., Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112, 3-41 (1999) · Zbl 0937.90030
[9] Buddhakulsomsiri, J., Kim, D.S., in press. Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, doi:10.1016/j.ejor.2005.04.030; Buddhakulsomsiri, J., Kim, D.S., in press. Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, doi:10.1016/j.ejor.2005.04.030 · Zbl 1137.90483
[10] Davis, E.; Patterson, J. H., A comparison of heuristic and optimum solutions in resource-constrained project scheduling, Management Science, 21, 8, 944-955 (1975)
[11] Drexel, A.; Grünewald, J., Nonpreemptive multi-mode resource-constrained project scheduling, IIE Transaction, 25, 5, 74-81 (1993)
[12] Drexl, A., Scheduling of project networks by job assignment, Management Science, 37, 12, 1590-1602 (1991) · Zbl 0729.91011
[13] Hartmann, S., Project Scheduling under Limited Resources: Models, Methods, and Applications (1999), Springer-Verlag: Springer-Verlag Berlin, Germany · Zbl 0957.90059
[14] Hartmann, S., Project scheduling with multiple modes: A genetic algorithm, Annals of Operations Research, 102, 1, 111-135 (2001) · Zbl 1024.90039
[15] Heilmann, R., Resource-constrained project scheduling: A heuristic of the multi-mode case, OR Spektrum, 23, 335-357 (2001) · Zbl 0985.90037
[16] Józefowska, J.; Mika, M.; Rozycki, R.; Waligora, G.; Węglarz, J., Simulated annealing for multi-mode resource-constrained project scheduling, Annals of Operations Research, 102, 137-155 (2001) · Zbl 0990.90513
[17] Kelley Jr., J.E., 1963. The critical path method. In: Muth, J.F., Thompson, G.L. (Eds.), Resource Planning and Scheduling, Industrial Scheduling, pp. 347-365.; Kelley Jr., J.E., 1963. The critical path method. In: Muth, J.F., Thompson, G.L. (Eds.), Resource Planning and Scheduling, Industrial Scheduling, pp. 347-365.
[18] Kolisch, R., Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, European Journal of Operational Research, 90, 320-333 (1996) · Zbl 0916.90151
[19] Kolisch, R., Efficient priority rules for the resource-constrained project scheduling problem, Journal of Operational Management, 14, 179-192 (1996)
[20] Kolisch, R.; Drexl, A., Local search for nonpreemptive multi-mode resource-constrained project scheduling, IIE Transactions, 29, 987-999 (1997)
[21] Kolisch, R.; Sprecher, A.; Drexl, A., Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science, 41, 10, 1693-1703 (1995) · Zbl 0870.90070
[22] Mika, M.; Waligóra, G.; Węglarz, J., Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, European Journal of Operational Research, 164, 3, 639-668 (2005) · Zbl 1061.90048
[23] Schirmer, A., Riesenberg, S., 1997. Parameterized heuristics for project scheduling—Biased random sampling methods. Manuskripte aus den Instituten für Betriebswirtschaftslehre, Kiel, No. 456.; Schirmer, A., Riesenberg, S., 1997. Parameterized heuristics for project scheduling—Biased random sampling methods. Manuskripte aus den Instituten für Betriebswirtschaftslehre, Kiel, No. 456.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.