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.

中文翻译：

---

一种在多模式项目中寻找稳健且具有成本效益的进度表的数据包络分析方法

工业项目的执行受制于 不确定性导致偏离指定的项目时间表。因此，需要生成强壮的对项目中断不敏感，例如活动持续时间的偏差。除此之外，高效的以低成本提供高稳健性的时间表是首选。本文着重于离散时间成本权衡问题并开发了一种新的方法来识别和排序有效的时间表。首先，一个大调度池生成具有鲁棒性的时间表。然后通过应用确定有效的时间表并对其进行排名数据包络分析 (DEA) 具有特定的 超效率模型。基于项目测试台和示例建设项目的广泛评估表明，所提出的方法可以找到有效的进度表并对其进行排名，可以适当地将其呈现给项目经理决策支持.