A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEM TO MAXIMIZING THE PRESENT VALUE

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.

MOSLEHI GH.; CHAHAR H.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2006 | Volume:25 | Issue:2 Page(s): 11-30

Download Full-Text

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

Persian Verion

View:

928

Download:

Cites:

Information Journal Paper

Title

A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEM TO MAXIMIZING THE PRESENT VALUE

Author(s)

MOSLEHI GH. | CHAHAR H. | Issue Writer Certificate

Keywords

PROJECT SCHEDULING PROBLEMQ3

NET PRESENT VALUEQ3

DIFFERENTIAL PROCEDUREQ3

RECURSIVE SEARCH PROCEDUREQ3

CASH FLOWQ3

Abstract

Department of industrial engineering and systems, isfahan university of technology this paper deals with resource unconstrained PROJECT SCHEDULING PROBLEMs with the objective of maximizing the NET PRESENT VALUE (NPV) of project CASH FLOWs. Here we present a heuristic algorithm named as DIFFERENTIAL PROCEDURE (Dif_AoA).In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have been generated. We have compared both the total time for solving the problem and NPV of the Dif_AoA with those of the RECURSIVE SEARCH PROCEDURE. Computational results show that the Dif_AoA performs very effectively. Extensive analysis has been performed to evaluate the node number, complexity network coefficients (CNC), and deadline.

Cites

No record.

References

No record.

Cite

APA: Copy

MOSLEHI, GH., & CHAHAR, H.. (2006). A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEM TO MAXIMIZING THE PRESENT VALUE. ESTEGHLAL, 25(2), 11-30. SID. https://sid.ir/paper/6037/en

Vancouver: Copy

MOSLEHI GH., CHAHAR H.. A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEM TO MAXIMIZING THE PRESENT VALUE. ESTEGHLAL[Internet]. 2006;25(2):11-30. Available from: https://sid.ir/paper/6037/en

IEEE: Copy

GH. MOSLEHI, and H. CHAHAR, “A HEURISTIC ALGORITHM FOR PROJECT SCHEDULING PROBLEM TO MAXIMIZING THE PRESENT VALUE,” ESTEGHLAL, vol. 25, no. 2, pp. 11–30, 2006, [Online]. Available: https://sid.ir/paper/6037/en

Related Journal Papers