CALCULATING THE MEAN PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS (MULTI-PROJECT SYSTEM) WITH FINITE CAPACITY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NOORI SIAMAK; YAGHOUBI SAEED

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2013 | Volume:24 | Issue:3 Page(s): 350-360

Download Full-Text

Persian Verion

View:

673

Download:

Cites:

Information Journal Paper

Title

CALCULATING THE MEAN PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS (MULTI-PROJECT SYSTEM) WITH FINITE CAPACITY

Author(s)

NOORI SIAMAK | YAGHOUBI SAEED | Issue Writer Certificate

Keywords

PROJECT MANAGEMENTQ2

NETWORK OF QUEUEQ1

MARKOV PROCESSESQ2

Abstract

In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity is performed independently in its corresponding service station with exponential distribution. For calculating the mean project completion time in dynamic PERT network with finite capacity, 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 manufacturing lead time distribution for any particular work, analytically. Finally, by using Little’s Theorem the mean project completion time is obtained.

Cites

No record.

References

No record.

Cite

APA: Copy

NOORI, SIAMAK, & YAGHOUBI, SAEED. (2013). CALCULATING THE MEAN PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS (MULTI-PROJECT SYSTEM) WITH FINITE CAPACITY. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 24(3), 350-360. SID. https://sid.ir/paper/65922/en

Vancouver: Copy

NOORI SIAMAK, YAGHOUBI SAEED. CALCULATING THE MEAN PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS (MULTI-PROJECT SYSTEM) WITH FINITE CAPACITY. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2013;24(3):350-360. Available from: https://sid.ir/paper/65922/en

IEEE: Copy

SIAMAK NOORI, and SAEED YAGHOUBI, “CALCULATING THE MEAN PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS (MULTI-PROJECT SYSTEM) WITH FINITE CAPACITY,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 24, no. 3, pp. 350–360, 2013, [Online]. Available: https://sid.ir/paper/65922/en

Related Journal Papers