Basit öğe kaydını göster

dc.contributor.authorEren, Elifen_US
dc.contributor.authorAtan, Sabri Tankuten_US
dc.date.accessioned2018-06-19T07:23:07Z
dc.date.available2018-06-19T07:23:07Z
dc.date.issued2018-04-16
dc.identifier.citationAtan, T. & Eren, E. (2018). Optimal project duration for resource leveling. European Journal of Operational Research, 266(2), 508-520. doi:10.1016/j.ejor.2017.10.022en_US
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860
dc.identifier.urihttps://hdl.handle.net/11729/1303
dc.identifier.urihttp://dx.doi.org/10.1016/j.ejor.2017.10.022
dc.description.abstractResource leveling is important in project management as resource fluctuations are costly and undesired. Typically, schedules with better resource profiles are obtained by shifting the activities within their float times using the schedule of fixed duration found by Critical Path Method. However, if the project duration can be extended, it is plausible to find a schedule with enhanced resource leveling since a longer duration allows for more float time for all activities. In this work, we relax the assumption of fixed durations in resource leveling formulations and investigate what the minimal project duration for the best leveled schedule should be. We provide mixed-integer linear models for several leveling objectives including the Release and Rehire metric. We show that not all metrics used for leveling under fixed durations may be appropriate when the project duration becomes a decision variable. Optimal solutions from smaller problems are used to find the magnitude of the extension needed and benefits obtained thereby. Since the problem is a NP-hard problem for which exact solutions cannot be obtained for large networks in reasonable time, we provide a greedy heuristic to be used with the Release and Rehire metric. Using an iterative framework, we also test the performance of a state-of-the-art heuristic algorithm from the literature on our problem. Computational experiments indicate that the more the number of resources is increased, the less leveling benefits are gained from extending the project. The optimal project durations and extension benefits can also be significantly different for different metrics.en_US
dc.language.isoengen_US
dc.publisherElsevier Science BVen_US
dc.relation.isversionof10.1016/j.ejor.2017.10.022
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectProject schedulingen_US
dc.subjectResource levelingen_US
dc.subjectVariable project durationen_US
dc.subjectMixed integer linear programmingen_US
dc.subjectRelease and Rehire metricen_US
dc.subjectCost problemen_US
dc.subjectSchedulingen_US
dc.subjectAlgorithmsen_US
dc.subjectMulti-mode resource-constraineden_US
dc.subjectComputational complexityen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectInteger programmingen_US
dc.subjectIterative methodsen_US
dc.subjectOutsourcingen_US
dc.subjectProject managementen_US
dc.subjectTurnaround timeen_US
dc.subjectProject durationen_US
dc.subjectRelease and Rehire metricen_US
dc.subjectOptimizationen_US
dc.titleOptimal project duration for resource levelingen_US
dc.typearticleen_US
dc.description.versionPublisher's Versionen_US
dc.relation.journalEuropean Journal Of Operational Researchen_US
dc.contributor.departmentIşık Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.contributor.departmentIşık University, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.contributor.authorID0000-0002-3241-4617
dc.identifier.volume266
dc.identifier.issue2
dc.identifier.startpage508
dc.identifier.endpage520
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.contributor.institutionauthorEren, Elifen_US
dc.contributor.institutionauthorAtan, Sabri Tankuten_US
dc.relation.indexWOSen_US
dc.relation.indexScopusen_US
dc.relation.indexScience Citation Index Expanded (SCI-EXPANDED)en_US
dc.description.qualityQ1
dc.description.wosidWOS:000423646700009


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster