Practical resources levelling using programming techniques
Call Number: AIT Thesis no. 1340 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. 1340Publication details: Bangkok : Asian Institute of Technology, 1978Description: 50 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1978 Summary: Most early applications of the Critical Path Method did not consider the resources required to complete each activity. Recently, increased attention has been given to this problem, and several methods have been suggested for scheduling activities which compete for resources which are available in stated maximum amounts. However, as of date, little has been done to increase resource utilization by smoothening resource demands along the project duration. This study undertakes to develop the Least Squares Method using the concept of Weighted Integer Multipliers for levelling single as well as multiple resource cases. A numerical example using a small hypothetical eight activity network is presented. Further computational experience with a more realistic 25 activity bridge construction network is reported. A possible extension of the approach to fixed time, multiple resources levelling cases for more complex networks is also suggested. It is concluded that the approach of the type given herein holds gr eat potential and is worthy of further investigation.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. 1340 (Browse shelf(Opens below)) | 2 | Available | 30050003026084 | |||||||||||||
20-AIT Publication
|
Asian Institute of Technology Library Archives | AIT Thesis no. 1340 (Browse shelf(Opens below)) | 3 | Available | 3005000302605x | |||||||||||||
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. 1340 (Browse shelf(Opens below)) | 1 | Available | 3005000302610x | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. 1340 (Browse shelf(Opens below)) | Available | 30050160082714 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand
Thesis (M.Eng.) - Asian Institute of Technology, 1978
Most early applications of the Critical Path Method did not consider the resources required to complete each activity. Recently, increased attention has been given to this problem, and several methods have been suggested for scheduling activities which compete for resources which are available in stated maximum amounts. However, as of date, little has been done to increase resource utilization by smoothening resource demands along the project duration. This study undertakes to develop the Least Squares Method using the concept of Weighted Integer Multipliers for levelling single as well as multiple resource cases. A numerical example using a small hypothetical eight activity network is presented. Further computational experience with a more realistic 25 activity bridge construction network is reported. A possible extension of the approach to fixed time, multiple resources levelling cases for more complex networks is also suggested. It is concluded that the approach of the type given herein holds gr eat potential and is worthy of further investigation.
There are no comments on this title.

AI Search