Abstract
This chapter develops a Markovian multi-objective mathematical programming model for the resource allocation problem in dynamic PERT networks with a finite capacity of concurrent projects. It is assumed that new projects are generated according to a Poisson process and activity durations are independent random variables with exponential distributions. This system is represented as a queueing network with finite concurrent projects, where each activity of a project is operated at a dedicated service station with one server located in a node of the network. In this investigation, not only activity durations, but also operating costs of service stations per period are all considered as independent random variables. This problem is formulated as a multi-objective model using continuous-time Markov processes with three conflicting objectives to optimally control the resources allocated to service stations. It is impossible to solve this problem optimally in a reasonable time, and consequently we apply a particle swarm optimization (PSO) method to solve this multi-objective continuous-time problem using a goal attainment technique. Finally, to show the effectiveness of the proposed PSO, we compare the results of a discrete-time approximation of the original optimal control problem with the results obtained by the proposed PSO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adler PS, Mandelbaum A, Nguyen V, Schwerer E (1995) From project to process management: an empirically-based framework for analyzing product development time. Manag Sci 41:458–484
Anavi-Isakow S, Golany B (2003) Managing multi-project environments through constant work-in-process. Int J Proj Manag 21:9–18
Azaron A, Modarres M (2005) Distribution function of the shortest path in networks of queues. OR Spectr 27:123–144
Azaron A, Tavakkoli-Moghaddam R (2006) A multi-objective resource allocation problem in dynamic PERT networks. Appl Math Comput 181:163–174
Azaron A, Tavakkoli-Moghaddam R (2007) Multi-objective time–cost trade-off in dynamic PERT networks using an interactive approach. Eur J Oper Res 180:1186–1200
Azaron A, Perkgoz C, Sakawa M (2005) A genetic algorithm approach for the time-cost trade-off in PERT networks. Appl Math Comput 168:1317–1339
Azaron A, Katagiri H, Sakawa M, Kato K, Memariani A (2006) A multi-objective resource allocation problem in PERT networks. Eur J Oper Res 172:838–854
Azaron A, Katagiri H, Sakawa M (2007) Time-cost trade-off via optimal control theory in Markov PERT networks. Ann Oper Res 150:47–64
Byali RP, Kannan MV (2008) Critical chain project management: a new project management philosophy for multi project environment. J Spacecr Technol 18:30–36
Chen V (1994) A 0-1 goal programming-model for scheduling multiple maintenance projects at a copper mine. Eur J Oper Res 6:176–191
Chen PH, Shahandashti SM (2009) Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints. Automat Constr 18:434–443
Cohen I, Golany B, Shtub A (2005) Managing stochastic, finite capacity, multi-project systems through the Cross Entropy methodology. Ann Oper Res 134:183–199
Cohen I, Golany B, Shtub A (2007) Resource allocation in stochastic, finite-capacity, multi-project systems through the cross entropy methodology. J Sched 10:181–193
Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the IEEE international symposium on micro machine and human science XI, Nagoya, pp 39–43
Eberhart RC, Simpson PK, Dobbins RW (1996) Computational intelligence PC tools. Academic, Boston
Fatemi Ghomi SMT, Ashjari B (2002) A simulation model for multi-project resource allocation. Int J Proj Manag 20:127–130
Gonçalves JF, Mendes JJM, Resende MGC (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res 189:1171–1190
Kanagasabapathi B, Rajendran C, Ananthanarayanan K (2009) Performance analysis of scheduling rules in resource-constrained multiple projects. Int J Ind Syst Eng 4:502–535
Kao HP, Hsieh B, Yeh Y (2006) A Petri-net based approach for scheduling and rescheduling resource-constrained multiple projects. J Chin Inst Ind Eng 23:468–477
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks IV, pp 1942–1948
Krüger D, Scholl A (2008) Managing and modelling general resource transfers in (multi-) project scheduling. OR Spectr 32:369–394
Kulkarni V, Adlakha V (1986) Markov and Markov-regenerative PERT networks. Oper Res 34:769–781
Kumanan S, Jegan JG, Raja K (2006) Multi-project scheduling using a heuristic and a genetic algorithm. Int J Adv Manuf Tech 31:360–366
Kurtulus IS, Davis EW (1982) Multi-project scheduling: categorization of heuristic rules performance. Manag Sci 28:161–172
Kurtulus IS, Narula SC (1985) Multi-project scheduling: analysis of project performance. IIE Trans 17:58–66
Li C, Wang K (2009) The risk element transmission theory research of multi-objective risk-time-cost trade-off. Comput Math Appl 57:1792–1799
Lova A, Tormos P (2001) Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling. Ann Oper Res 102:263–286
Lova A, Maroto C, Tormos P (2000) A multicriteria heuristic method to improve resource allocation in multiproject scheduling. Eur J Oper Res 127:408–424
Nozick LK, Turnquist MA, Xu N (2004) Managing portfolios of projects under uncertainty. Ann Oper Res 132:243–256
Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Int 1:33–57
Pritsker AAB, Watters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci 16:93–108
Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE international conference on evolutionary computation, pp 69–73
Siegel S (1956) Non-parametric statistics for the behavioral sciences. McGraw-Hill, New York
Tsubakitani S, Deckro RF (1990) A heuristic for multi-project scheduling with limited resources in the housing industry. Eur J Oper Res 49:80–91
Wiest JD (1967) A heuristic model for scheduling large projects with limited resources. Manag Sci 13:359–377
Yaghoubi S, Noori S, Azaron A, Tavakkoli-Moghaddam R (2011a) Resource allocation in dynamic PERT networks with finite capacity. Eur J Oper Res 215:670–678
Yaghoubi S, Noori S, Bagherpour M (2011b) Resource allocation in multi-server dynamic PERT networks using multi-objective programming and Markov process. Iran J Sci Technol 35: 131–147
Yaghoubi S, Noori S, Azaron A, Fynes B (2014) Resource allocation in multi-class dynamic PERT networks with finite capacity. Eur J Oper Res (submitted)
Ying Y, Shou Y, Li M (2009) Hybrid genetic algorithm for resource constrained multi-project scheduling problem. J Zhejiang Univ (Eng Sci) 43:23–27
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Yaghoubi, S., Noori, S., Azaron, A. (2015). The Markovian Multi-Criteria Multi-Project Resource-Constrained Project Scheduling Problem. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol. 2. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05915-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-05915-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05914-3
Online ISBN: 978-3-319-05915-0
eBook Packages: Business and EconomicsBusiness and Management (R0)