BICRITERIA RESOURCE ALLOCATION PROBLEM IN PERT NETWORKS

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.

AZARON A.; MEMARIANI A.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2004 | Volume:17 | Issue:2 (TRANSACTIONS A: BASICS) Page(s): 157-168

Download Full-Text

View:

341

Download:

115

Cites:

Information Journal Paper

Title

BICRITERIA RESOURCE ALLOCATION PROBLEM IN PERT NETWORKS

Author(s)

AZARON A. | MEMARIANI A. | Issue Writer Certificate

Keywords

PROJECT MANAGEMENT

MULTIPLE OBJECTIVE PROGRAMMING

CONTROL

Abstract

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration is a non-increasing function of the amount of resource allocated to it. The direct cost of each activity is assumed to be a non-decreasing function of the amount of resource allocated to it. Finally, we use the goat attainment method to solve the related bicriteria optimal CONTROL problem numerically, by converting this problem to a related bicriteria nonlinear programming, and obtain the optimal values of the resources allocated to the activities.

Cites

No record.

References

No record.

Cite

APA: Copy

AZARON, A., & MEMARIANI, A.. (2004). BICRITERIA RESOURCE ALLOCATION PROBLEM IN PERT NETWORKS. INTERNATIONAL JOURNAL OF ENGINEERING, 17(2 (TRANSACTIONS A: BASICS)), 157-168. SID. https://sid.ir/paper/355326/en

Vancouver: Copy

AZARON A., MEMARIANI A.. BICRITERIA RESOURCE ALLOCATION PROBLEM IN PERT NETWORKS. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2004;17(2 (TRANSACTIONS A: BASICS)):157-168. Available from: https://sid.ir/paper/355326/en

IEEE: Copy

A. AZARON, and A. MEMARIANI, “BICRITERIA RESOURCE ALLOCATION PROBLEM IN PERT NETWORKS,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 17, no. 2 (TRANSACTIONS A: BASICS), pp. 157–168, 2004, [Online]. Available: https://sid.ir/paper/355326/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops