Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.creator | Wan, Chak-keung | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3546 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Project scheduling under resource constraints : a study for the applicability and performance of a new heuristic | en_US |
| dcterms.abstract | Aside from the commonly used priority dispatching Heuristics of most algorithms for multiresource-constrained project scheduling problems, Bell and Han (1991) has suggested a simple heuristic that employs resource conflict repairing technique and Hill Climbing improvement approach to provide a reasonably good feasible schedule without violating the resource constraints. In the light of this new approach, a comparative study concerning the applicability and also the ability of finding the minimal project duration of the heuristic is carried out. A commonly used Project Management software " Microsoft Project 4.0" is used to facilitate the study. A comparison is made between the feasible solutions obtained from the Automatic Resource-leveling Function of Microsoft Project 4.0 and from following the Bell & Han's heuristic procedure. In order to show the different ability of the approaches, 6 tested networks are so designed with different characteristics by following the scheme of the experiment of Cooper(1976) . The tested networks are described by four parameters related to the size, structure of the project graph, the project time properties and resource properties. The first parameter used is "order strength," by which the structure of the project graph is specified. The second parameter used is "density" which is a function to the free float of activities. The third parameter used is "Resource factor" which is defined as the ratio of the average number of different kinds of resources used per job to the number of total type of resource available. The last parameter used is "resource strength" which concerns the quantity required by activities in the project relates to the amount of available resource . The sizes of the sample projects are relatively small due to the limitation of this research , and are varying from 10 and 15 activities only. A modification of the Heuristic of Bell & Han(1991) is suggested in attempting to tackle the shortcoming of the Hill-climbing technique used by Bell & Han. The comparison among the results obtained from the three different methods for the 6 testing networks shows that MS Project 4.0 can provide better feasible schedule for network with Resource Strength closed to 2.0. However, Bell & Han'S and the Modified Heuristic perform better for flexible networks with smaller Order Strength, and all three methods perform similarly for networks that are tightly constrained in resource. | en_US |
| dcterms.extent | viii, 102 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1996 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Project management | en_US |
| dcterms.LCSH | Production planning | en_US |
| dcterms.LCSH | Production scheduling | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b12369846.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.94 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3546