Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/157475
Authors: 
Shahriari, Mohammadreza
Year of Publication: 
2016
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 12 [Year:] 2016 [Pages:] 59-169
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.
Subjects: 
Time-cost tradeoff
Time value of money
Crashing
NSGA-II
Multi-objective problem
AOA network
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/4.0/
Document Type: 
Article

Files in This Item:
File
Size
963.65 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.