Robust Optimization Models for the Discrete Time/Cost Trade-Off Problem
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Developing models and algorithms to generate robust project schedules that are less sensitive to disturbances are essential in today's highly competitive uncertain project environments. This paper addresses robust scheduling in project environments; specifically, we address the discrete time/cost trade-off problem (DTCTP). We formulate the robust DTCTP with three alternative optimization models in which interval uncertainty is assumed for the unknown cost parameters. We develop exact and heuristic algorithms to solve these robust optimization models. Furthermore, we compare the schedules that have been generated with these models on the basis of schedule robustness. (C) 2010 Elsevier B.V. All rights reserved.
Description
Hazir, Oncu/0000-0003-0183-8772; Gunalay, Yavuz/0000-0003-1541-9755
Keywords
Project Scheduling, Robust Optimization, Benders Decomposition, Tabu Search, Mathematical models, Cost parameters, Benders decomposition, Tabu Search, Robust Optimization, Benders Decomposition, Interval uncertainty, Project Scheduling, Robust scheduling, Optimization models, Tabu search, Project environment, Schedule robustness, Heuristic algorithms, Project scheduling, Robust optimization, Project schedules, Time/cost trade-off problem
Fields of Science
0211 other engineering and technologies, 02 engineering and technology
Citation
Hazir, Oncu; Erel, Erdal; Gunalay, Yavuz, "Robust optimization models for the discrete time/cost trade-off problem", International Journal of Production Economics, Vol.130, No.1, (2011).
WoS Q
Scopus Q

OpenCitations Citation Count
58
Volume
130
Issue
1
Start Page
87
End Page
95
PlumX Metrics
Citations
CrossRef : 25
Scopus : 67
Captures
Mendeley Readers : 66
SCOPUS™ Citations
67
checked on Jun 19, 2026
Web of Science™ Citations
65
checked on Jun 19, 2026
Page Views
3
checked on Jun 19, 2026
Google Scholar™


