Resource allocation in dynamic PERT networks with finite capacity
This article models the resource allocation problem in dynamic PERT networks with finite capacity of concurrent projects (COnstant Number of Projects In Process (CONPIP)), where activity durations are independent random variables with exponential distributions, and the new projects are generated according to a Poisson process. The system is represented as a queuing network with finite concurrent projects, where each activity of a project is performed at a devoted service station with one server located in a node of the network. For modeling dynamic PERT networks with CONPIP, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created to solve and find the completion time distribution for any particular project. Finally, we propose a multi-objective model with three conflict objectives to optimally control the resources allocated to the servers, and apply the goal attainment method to solve a discrete-time approximation of the original multi-objective problem.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Tan, BarIs & Gershwin, Stanley B., 2009. "Analysis of a general Markovian two-stage continuous-flow production system with a finite buffer," International Journal of Production Economics, Elsevier, vol. 120(2), pages 327-339, August.
- Jouini, Oualid & Dallery, Yves & Aksin, Zeynep, 2009. "Queueing models for full-flexible multi-class call centers with real-time anticipated delays," International Journal of Production Economics, Elsevier, vol. 120(2), pages 389-399, August.
- Antonio Lova & Pilar Tormos, 2001. "Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 263-286, February.
- A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
- Paul S. Adler & Avi Mandelbaum & Viên Nguyen & Elizabeth Schwerer, 1995. "From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time," Management Science, INFORMS, vol. 41(3), pages 458-484, March.
- Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
- Izack Cohen & Boaz Golany & Avraham Shtub, 2005. "Managing Stochastic, Finite Capacity, Multi-Project Systems through the Cross-Entropy Methodology," Annals of Operations Research, Springer, vol. 134(1), pages 183-199, February.
- Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
- Tsubakitani, Shigeru & Deckro, Richard F., 1990. "A heuristic for multi-project scheduling with limited resources in the housing industry," European Journal of Operational Research, Elsevier, vol. 49(1), pages 80-91, November.
- I. Kurtulus & E. W. Davis, 1982. "Multi-Project Scheduling: Categorization of Heuristic Rules Performance," Management Science, INFORMS, vol. 28(2), pages 161-172, February.
- Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
- Lova, Antonio & Maroto, Concepcion & Tormos, Pilar, 2000. "A multicriteria heuristic method to improve resource allocation in multiproject scheduling," European Journal of Operational Research, Elsevier, vol. 127(2), pages 408-424, December.
- Jerome D. Wiest, 1967. "A Heuristic Model for Scheduling Large Projects with Limited Resources," Management Science, INFORMS, vol. 13(6), pages B359-B377, February.
- Azaron, Amir & Tavakkoli-Moghaddam, Reza, 2007. "Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1186-1200, August.
- Linda Nozick & Mark Turnquist & Ningxiong Xu, 2004. "Managing Portfolios of Projects under Uncertainty," Annals of Operations Research, Springer, vol. 132(1), pages 243-256, November.
- Oualid Jouini & Yves Dallery & Zeynep Aksin, 2009. "Queueing models for full-flexible multi-class call centers with real-time anticipated delays," Post-Print hal-00565481, HAL.
- Amir Azaron & Hideki Katagiri & Masatoshi Sakawa, 2007. "Time-cost trade-off via optimal control theory in Markov PERT networks," Annals of Operations Research, Springer, vol. 150(1), pages 47-64, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:215:y:2011:i:3:p:670-678. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.