Abstract
The execution of industrial projects is subject to uncertainties that cause deviations from the designated project schedules. Therefore, it is desired to generate robust schedules in the sense of being insensitive to project disruptions, such as deviations in activity durations. Beyond that, efficient schedules that offer high robustness at a low cost are preferred. This paper focuses on the discrete time-cost tradeoff problem and develops a new method for identifying and ranking efficient schedules. First, a large schedule pool with robust schedules is generated. Efficient schedules are then identified and ranked by applying data envelopment analysis (DEA) with a particular super-efficiency model. An extensive evaluation based on a project testbed and an example construction project shows that the proposed method finds and ranks efficient schedules, that can be suitably presented to a project manager for decision support .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: IEEE Transactions on Engineering Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
