INTRODUCING A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEMS WITH THE OBJECT OF MAXIMIZING THE NET PRESENT VALUE IN THE ABSENCE OF RESOURCE CONSTRAINTS

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.

AMIRI MAGHSOUD; MASHATZADEGAN H.R.; AZIZ MOHAMMADI R.; YAGHOUBI ALI

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

Journal Paper

Paper Information

Journal: INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING) Year:2009 | Volume:24 | Issue:45 Page(s): 23-29

Download Full-Text

Persian Verion

View:

1,377

Download:

Cites:

Information Journal Paper

Title

INTRODUCING A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEMS WITH THE OBJECT OF MAXIMIZING THE NET PRESENT VALUE IN THE ABSENCE OF RESOURCE CONSTRAINTS

Author(s)

AMIRI MAGHSOUD | MASHATZADEGAN H.R. | AZIZ MOHAMMADI R. | YAGHOUBI ALI | Issue Writer Certificate

Keywords

PROJECT SCHEDULINGQ3

CASH FLOWQ3

NET PRESENT VALUEQ3

PROJECT TIME ORIENTEDQ3

NETWORK COMPLEXITY COEFFICIENTQ3

Abstract

PROJECT SCHEDULING methods that presented till now usually are time oriented which their objective is minimizing the project makespan without considering activities CASH FLOW. In this paper, we propose a heuristic algorithm with unconstrained resources assumption in order to maximize the NET PRESENT VALUE which can solve problems with large number of nodes. It also gives an almost efficient answer in the suitable time. Proposed algorithm was compared with one of the exact algorithm in much aspect especially in number of project nodes, project deadline time. NETWORK COMPLEXITY COEFFICIENT and required time for solving the problem. The results indicate that the proposed algorithm is more efficient.

Cites

No record.

References

No record.

Cite

APA: Copy

AMIRI, MAGHSOUD, MASHATZADEGAN, H.R., AZIZ MOHAMMADI, R., & YAGHOUBI, ALI. (2009). INTRODUCING A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEMS WITH THE OBJECT OF MAXIMIZING THE NET PRESENT VALUE IN THE ABSENCE OF RESOURCE CONSTRAINTS. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), 24(45), 23-29. SID. https://sid.ir/paper/107592/en

Vancouver: Copy

AMIRI MAGHSOUD, MASHATZADEGAN H.R., AZIZ MOHAMMADI R., YAGHOUBI ALI. INTRODUCING A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEMS WITH THE OBJECT OF MAXIMIZING THE NET PRESENT VALUE IN THE ABSENCE OF RESOURCE CONSTRAINTS. INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING)[Internet]. 2009;24(45):23-29. Available from: https://sid.ir/paper/107592/en

IEEE: Copy

MAGHSOUD AMIRI, H.R. MASHATZADEGAN, R. AZIZ MOHAMMADI, and ALI YAGHOUBI, “INTRODUCING A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEMS WITH THE OBJECT OF MAXIMIZING THE NET PRESENT VALUE IN THE ABSENCE OF RESOURCE CONSTRAINTS,” INDUSTRIAL ENGINEERING & MANAGEMENT SHARIF (SHARIF: ENGINEERING), vol. 24, no. 45, pp. 23–29, 2009, [Online]. Available: https://sid.ir/paper/107592/en

Related Journal Papers