Kısıtlı kaynaklar altında proje yönetimi ve bir uygulama
Loading...
Files
Date
2005-04-01
Authors
Atlı, Ömer
Journal Title
Journal ISSN
Volume Title
Publisher
Uludağ Üniversitesi
Abstract
CPM, PERT ve simülasyon gibi teknikler, karmaşık ve büyük ölçekli projelerin yönetiminde; yöneticilere planlama, çizelgeleme ve denetim konularında büyük yararlar sağlamakla birlikte, kısıtlı kaynaklar altında proje faaliyetlerinin yürütülmesinde yetersiz kalmaktadır. Bu yöntemlerin yetersizliklerini giderecek, organizasyonların zaman, para ve giderek azalmakta olan kıt kaynaklan daha verimli kullanmalarına imkan verecek yaklaşımlara ihtiyaç duyulmaktadır. Birinci bölümde, Kaynak Kısıtlı Proje Çizelgeleme problemlerinin tanımı yapılmış ve proje çizelgelemedeki yeri açıklanmıştır. İkinci bölümde, Kaynak Kısıtlı Proje Çizelgeleme esasları anlatılmış ve örnek bir problem için tamsayılı programlama modeli oluşturulmuştur. Üçüncü bölümde, tamsayılı programlama modellerinin çözümündeki hesaplama zorluğu nedeniyle oluşan dezavantaj yerine daha basit ve hesaplanabilir kolay çözümler veren sezgisel yaklaşımlarla Kaynak Kısıtlı Proje Çizelgeleme Problemi yeniden ele alınmış ve bu sezgisel yaklaşımlardan, Tabu arama prosedürü ile Microsoft Visual C++ 6.0'da geliştirilen bir program aracılığıyla yeni çözümler aranmıştır. Son bölümde, literatürde 110 Patterson problemleri olarak bilinen veri kümesi özerinde denemeler yapılmıştır. Hesaplama sonuçlarıyla belirlenen performans kriterleri karşılaştırılarak bilinen sezgisel yaklaşımların tabu arama yöntemiyle birlikte çok daha hızlı, optimal ve optimale yakın iyi sonuçlar verdiği belirlenmiştir.
In this work, the resource constrained project scheduling problem is studied. In the first chapter, the terms and methods that are widely used in the literature are explained. Resource Constrained Project Scheduling is defined and it's importance in project scheduling is explained. Project scheduling has long been an area of intensive research, but until recently most efforts have been dedicated to developing solution procedures and generalizing model, while little work was done on generating problem instances. In order to explain the Resource-Constrained Project Scheduling Problems, a mathematical model is developed. The wide applicability and the computations about other production management systems are explained. This thesis has 4 chapters. The first chapter provides a short introduction to the study. The second chapter presents a wide literature review of the resource constrained project scheduling. The problem is described and the foundations of the proposed solution approach are provided in the third chapter. Finally, in the fourth chapter, we present the computational results and compare them with that of earlier applicable research. When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resource-constrained scheduling problems are NP-hard. A higher level heuristic procedure "tabu search" is proposed to provide good solutions to resource-constrained, deterministic project scheduling problems with deterministic activity duration. For the deterministic problems, most of the optimal schedules for the test problems are found. Computational results are presented which establish the superiority of the results obtained by an approach which is the combination of tabu search with the existing heuristics.
In this work, the resource constrained project scheduling problem is studied. In the first chapter, the terms and methods that are widely used in the literature are explained. Resource Constrained Project Scheduling is defined and it's importance in project scheduling is explained. Project scheduling has long been an area of intensive research, but until recently most efforts have been dedicated to developing solution procedures and generalizing model, while little work was done on generating problem instances. In order to explain the Resource-Constrained Project Scheduling Problems, a mathematical model is developed. The wide applicability and the computations about other production management systems are explained. This thesis has 4 chapters. The first chapter provides a short introduction to the study. The second chapter presents a wide literature review of the resource constrained project scheduling. The problem is described and the foundations of the proposed solution approach are provided in the third chapter. Finally, in the fourth chapter, we present the computational results and compare them with that of earlier applicable research. When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resource-constrained scheduling problems are NP-hard. A higher level heuristic procedure "tabu search" is proposed to provide good solutions to resource-constrained, deterministic project scheduling problems with deterministic activity duration. For the deterministic problems, most of the optimal schedules for the test problems are found. Computational results are presented which establish the superiority of the results obtained by an approach which is the combination of tabu search with the existing heuristics.
Description
Keywords
Kaynak kısıtlı proje çizelgeleme, Proje yönetimi, Proje çizelgelerne ve tabu arama, Resource-constrained project scheduling, Project management, Project scheduling and tabu search
Citation
Atlı, Ö. (2005). Kısıtlı kaynaklar altında proje yönetimi ve bir uygulama. Yayınlanmamış yüksek lisans tezi. Uludağ Üniversitesi Fen Bilimleri Enstitüsü.