Article ID: | iaor20062030 |
Country: | Netherlands |
Volume: | 165 |
Issue: | 2 |
Start Page Number: | 339 |
End Page Number: | 358 |
Publication Date: | Sep 2005 |
Journal: | European Journal of Operational Research |
Authors: | Drexl Andreas, Akkan Can, Kimms Alf |
Keywords: | scheduling, networks, programming: integer |
In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time–cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great practical relevance, did not receive much attention so far. Given a set of modes (time–cost pairs) for each activity, the objective of the discrete time–cost tradeoff problem is to select a mode for each activity so that the total cost is minimized while meeting a given project deadline. The discrete time–cost tradeoff problem is a strongly