×
Buddhakulsomsiri, Jirachai; Kim, David S.

Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. (English) Zbl 1137.90483

Eur. J. Oper. Res. 175, No. 1, 279-295 (2006); corrigendum ibid. 240, No. 2, 602 (2015).
Summary: This paper presents results from an extensive computational study of the multi-mode resource-constrained project scheduling problem when activities can be split during scheduling under situations where resources may be temporarily not available. 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, and assignment to other finite duration activities. A designed experiment is conducted that investigates project makespan improvement when activity splitting is permitted in various project scenarios, where different project scenarios are defined by parameters that have been used in the research literature. A branch-and-bound procedure is applied to solve a number of small project scheduling problems with and without activity splitting. The results show that, in the presence of resource vacations and temporary resource unavailability, activity splitting can significantly improve the optimal project makespan in many scenarios, and that the makespan improvement is primarily dependent on those parameters that impact resource utilization.

Cited in 1 Review
Cited in 13 Documents

MSC:

90B35 Deterministic scheduling theory in operations research

Keywords:

multi-mode resource-constrained project scheduling; activity splitting; time-varying resource capacities; branch-and-bound

Software:

PSPLIB
PDF BibTeX XML Cite
\textit{J. Buddhakulsomsiri} and \textit{D. S. Kim}, Eur. J. Oper. Res. 175, No. 1, 279--295 (2006; Zbl 1137.90483)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

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] Bianco, L.; Caramia, M.; Dell’Olmo, P., Solving a preemptive project scheduling problem with coloring techniques, (), 135-145
[3] Boctor, F., Heuristics for scheduling projects with resource restrictions and several resource-duration modes, International journal of production research, 31, 11, 2547-2558, (1993)
[4] 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
[5] Brucker, P.; Drexl, A.; Möhring, R.; Neumann, K., Resource-constrained project scheduling: notation, classification, models, and methods, European journal of operational research, 112, 3-41, (1999) · Zbl 0937.90030
[6] Buddhakulsomsiri, J., Kim, D.A., 2004. Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, under review. · Zbl 1107.90015
[7] Demeulemeester, E.L.; Herroelen, W.S., An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem, European journal of operational research, 90, 334-338, (1996) · Zbl 0916.90149
[8] Demeulemeester, E.L.; Herroelen, W.S., A branch-and-bound procedure for the multiple resource-constrained project scheduling problems, Management science, 38, 12, 1803-1818, (1992) · Zbl 0761.90059
[9] Demeulemeester, E.L.; Herroelen, W.S., New benchmark results for the resource-constrained project scheduling problem, Management science, 43, 11, 1485-1492, (1995) · Zbl 0914.90160
[10] Drexl, A.; Grünewald, J., Nonpreemptive multi-mode resource-constrained project scheduling, IIE transactions, 25, 5, 74-81, (1993)
[11] Hartmann, S., Project scheduling with multiple modes: A genetic algorithm, Annals of operations research, 102, 111-135, (2001) · Zbl 1024.90039
[12] Hartmann, S.; Drexl, A., Project scheduling with multiple modes: A comparison of exact algorithms, Networks, 32, 4, 283-298, (1998) · Zbl 1002.90025
[13] Hartmann, S.; Kolisch, R., Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, European journal of operational research, 127, 394-407, (2000) · Zbl 0985.90036
[14] Heilmann, R., Resource-constrained project scheduling: A heuristic of the multi-mode case, OR spektrum, 23, 335-357, (2001) · Zbl 0985.90037
[15] Heilmann, R., A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags, European journal of operational research, 144, 348-365, (2003) · Zbl 1012.90513
[16] Herroelen, W.P.; Demeulemeester, E.L.; De Reyck, B., A classification scheme for project scheduling, (), 1-26
[17] Jozefowska, J.; Mika, M.; Rozycki, R.; Waligora, G.; Weglarz, J., Simulated annealing for multi-mode resource-constrained project scheduling, Annals of operations research, 102, 137-155, (2001) · Zbl 0990.90513
[18] Kelley, J.E., The critical path method: resource planning and scheduling, (), 347-365
[19] 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
[20] Kolisch, R., Efficient priority rules for the resource-constrained project scheduling problem, Journal of operational management, 14, 3, 179-192, (1996)
[21] Kolisch, R.; Sprecher, A., PSPLIB—A project scheduling problem library, European journal of operational research, 96, 205-216, (1996) · Zbl 0947.90587
[22] Kolisch, R., Sprecher, A., Drexl, A., 1992. Characterization and generation of a general class of resource-constrained project scheduling problems. Manuskripte aus den Instituten fur Betriebswirtschaftslehre, No. 301, Kiel. · Zbl 0870.90070
[23] 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
[24] Nonobe, K.; Ibaraki, T., Formulation and tabu search algorithm for the resource constrained project scheduling problem, (), 557-588 · Zbl 1048.90116
[25] Patterson, J.H., A comparison of exact procedures for solving the multiple constrained resource project scheduling problem, Management science, 30, 7, 854-867, (1984)
[26] Patterson, J.H.; Slowinski, R.; Talbot, F.B.; Weglarz, J., An algorithm for a general class of precedence and resource constrained scheduling problems, (), 3-28
[27] Sprecher, A.; Drexl, A., Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm, European journal of operational research, 107, 431-450, (1998) · Zbl 0943.90042
[28] Sprecher, A.; Kolisch, R.; Drexl, A., Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem, European journal of operational research, 80, 94-102, (1995) · Zbl 0927.90054
[29] Sprecher, A.; Hartmann, A.; Drexl, A., An exact algorithm for project scheduling with multiple modes, OR spektrum, 19, 195-203, (1997) · Zbl 0885.90059
[30] Valls, V.; Laguna, M.; Lino, P.; Perez, A.; Quintanilla, S., Project scheduling with stochastic activity interruptions, (), 333-353
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.