Discrete time/cost trade-off problem in project scheduling

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü, Türkiye

Tezin Onay Tarihi: 2007

Öğrenci: AHMET BAYKAL HAFIZOĞLU

Danışman: MERAL AZİZOĞLU

Özet:

In project scheduling, the activity durations can often be reduced by dedicating additional resources. Time/Cost Trade-off Problem considers the compromise between the total cost and project duration. The discrete version of the problem assumes a number of time/cost pairs, so called modes, and selects a mode for each activity. In this thesis we consider the Discrete Time/Cost Trade-off Problem. We first study the Deadline Problem, i.e., the problem of minimizing total cost subject to a deadline on project duration. To solve the Deadline Problem, we propose several optimization and approximation algorithms that are based on optimal Linear Programming Relaxation solutions. We then analyze the problem of generating all efficient solutions, and propose an approach that uses the successive solutions of the Deadline Problem. Our computational results on large-sized problem instances have revealed the satisfactory behavior of our algorithms.