A Data Envelopment Analysis Method for Finding Robust and Cost-Efficient Schedules in Multimode Projects


Schmidt K. V. , Hazır Ö.

IEEE Transactions On Engineering Management, vol.76, no.2, pp.414-429, 2020 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 76 Issue: 2
  • Publication Date: 2020
  • Doi Number: 10.1109/tem.2018.2888817
  • Journal Name: IEEE Transactions On Engineering Management
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, Academic Search Premier, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Public Affairs Index, Civil Engineering Abstracts
  • Page Numbers: pp.414-429
  • Keywords: Data envelopment analysis (DEA), efficiency, multicriteria decision making, project scheduling, robustness, TRADE-OFF PROBLEM, DEA, PERFORMANCE, MANAGEMENT, ALGORITHM, SUBJECT
  • Middle East Technical University Affiliated: Yes

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.