Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/487121Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Khalim A. Rashid, Assoc. Prof. Ir. Dr. | - |
| dc.contributor.author | Wisam Jasim Hilo (P40774) | - |
| dc.date.accessioned | 2023-10-11T02:29:07Z | - |
| dc.date.available | 2023-10-11T02:29:07Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier.other | ukmvital:71376 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/487121 | - |
| dc.description | Total float, critical path and early completion of a project are very important information for a project manager to plan and control a project more actively and efficiently. Although various solution approaches to project scheduling have been proposed, some approaches do not have a capability to find optimal scheduling. Moreover, the use of an approach, which combines Critical Path Method (CPM), Resources Constrained Scheduling Technique (RCST) and multiple calendars features has not yet been established. On the other hand, major project management software packages such as Primavera version 6.1 (P6.1) provides functions to treat project scheduling. However, the basic theories of project scheduling treatment have not been disclosed to public, so users assume (without clear knowledge) that the project schedule is correct. The development of an algorithm motivated by CPM schedule is not realistic since it assumes unlimited resources. Also, RCST may consider resource limitations, it does not provide accurate total floats and critical path. In addition, scheduling with multiple calendars does not consider the possibility of earliest times of activities. The objective of this study is to provide the examination of the scheduling operations in P6.1 to describe how project scheduling is handled. Also to proposes a new algorithm that gives a schedule more effectively and efficiently by using the advantages of previous methods. The methodology of this research is development an algorithm considering nonworking days and nonworking period with single and multiple calendars. The algorithm covers all relationships with lags of zero, positive and negative values. Based on the new algorithm, a computer program, called "New Approaches for Scheduling Construction Project Software (NASCPS)", was developed using Visual C++ and Visual Basic languages to enable users to solve these problems. The program's size is about 8.0MB. It displays more than 40 windows and message boxes. Project data is input directly to its windows or is imported from P6.1. The developed algorithm was validated with the comparison of the existing algorithms available in the literature. NASCPS was also compared with P6.1 using three case studies. The results of the validation showed that the algorithm produces more appropriate total float and critical path. The proposed algorithm improves scheduling better than CPM and RCST. The algorithm is capable to supply an alternative schedule in addition to the improved initial schedule. Generally, it provides schedule with earlier time to complete the project. On the other hand, this research discovers that P6.1 may generate an inappropriate total float and critical path when nonworking days are involved in multiple calendars, and impractically results when nonworking period are used. Major contributions of this research are: the proposed algorithm is an approach to limited or unlimited resource scheduling with single and multiple calendars; and it can be a promising alternative to scheduling as it combines the best aspects of existing algorithm.,PhD | - |
| dc.language.iso | eng | - |
| dc.publisher | UKM, Bangi | - |
| dc.relation | Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina | - |
| dc.rights | UKM | - |
| dc.subject | Scheduling Resource Constrained | - |
| dc.subject | Alternative Approach For Scheduling Resource | - |
| dc.subject | Production scheduling | - |
| dc.title | An Alternative Approach For Scheduling Resource Constrained In Single And Multiple Calendars | - |
| dc.type | Theses | - |
| dc.format.pages | 301 | - |
| dc.identifier.callno | TS157.5 .H537 2013 3 | - |
| dc.identifier.barcode | 000691 | - |
| Appears in Collections: | Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_71376+Source01+Source010.PDF Restricted Access | 9.66 MB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.