MULTI-OBJECTIVE OPTIMIZATION OF DISCRETE TIME-COST TRADEOFF PROBLEM IN PROJECT NETWORKS USING NON-DOMINATED SORTING GENETIC ALGORITHM (TECHNICAL ARTICLE)

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.

SHAHRIARI MOHAMMADREZA

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2016 | Volume:12 | Issue:2 Page(s): 0-0

Download Full-Text

View:

250

Download:

151

Cites:

Information Journal Paper

Title

MULTI-OBJECTIVE OPTIMIZATION OF DISCRETE TIME-COST TRADEOFF PROBLEM IN PROJECT NETWORKS USING NON-DOMINATED SORTING GENETIC ALGORITHM (TECHNICAL ARTICLE)

Author(s)

SHAHRIARI MOHAMMADREZA | Issue Writer Certificate

Keywords

TIME-COST TRADEOFF

TIME VALUE OF MONEY

CRASHING

NSGA-II

MULTI-OBJECTIVE PROBLEM

AOA NETWORK

Abstract

The TIME-COST TRADEOFF problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate extra resources to short the finishing time of project and the project managers are intended to spend the lowest possible amount of money and achieve the maximum CRASHING time, as a result, both direct and indirect costs will be influenced in the project, and here, we are facing into the TIME VALUE OF MONEY. It means that when we crash the starting activities in a project, the extra investment will be tied in until the end date of the project; however, when we crash the final activities, the extra investment will be tied in for a much shorter period. This study is presenting a two-objective mathematical model for balancing compressing the project time with activities delay to prepare a suitable tool for decision makers caught in available facilities and due to the time of projects. Also drawing the scheduling problem to real world conditions by considering nonlinear objective function and the TIME VALUE OF MONEY are considered. The presented problem was solved using NSGA-II, and the effect of time compressing reports on the non-dominant set.

Cites

No record.

References

No record.

Cite

APA: Copy

SHAHRIARI, MOHAMMADREZA. (2016). MULTI-OBJECTIVE OPTIMIZATION OF DISCRETE TIME-COST TRADEOFF PROBLEM IN PROJECT NETWORKS USING NON-DOMINATED SORTING GENETIC ALGORITHM (TECHNICAL ARTICLE). JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 12(2), 0-0. SID. https://sid.ir/paper/310054/en

Vancouver: Copy

SHAHRIARI MOHAMMADREZA. MULTI-OBJECTIVE OPTIMIZATION OF DISCRETE TIME-COST TRADEOFF PROBLEM IN PROJECT NETWORKS USING NON-DOMINATED SORTING GENETIC ALGORITHM (TECHNICAL ARTICLE). JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2016;12(2):0-0. Available from: https://sid.ir/paper/310054/en

IEEE: Copy

MOHAMMADREZA SHAHRIARI, “MULTI-OBJECTIVE OPTIMIZATION OF DISCRETE TIME-COST TRADEOFF PROBLEM IN PROJECT NETWORKS USING NON-DOMINATED SORTING GENETIC ALGORITHM (TECHNICAL ARTICLE),” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 12, no. 2, pp. 0–0, 2016, [Online]. Available: https://sid.ir/paper/310054/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops