03199nam a2200433 4500 20260818173735.0 250398 th eng .b10517352 AIT Thesis no. 1340 Gopalaratnam, Vellore Shroff Practical resources levelling using programming techniques Bangkok : Asian Institute of Technology, 1978 50 p. Thesis ; no. 1340 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. Critical path analysis Programmed instruction Scott, David, Chairperson Jearkjirm, Vithool, Examination Committee Usami, Tsutomu, Examination Committee United Kingdom Government, Scholarship Donor Asian Institute of Technology. Thesis ; no. 1340 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B22937 .b10517352 mnait x 251028 4 951012 m a x 0 mnait mnarc mnait mnarc 20 40 Barcode : 30050003026084 CREATED : 1994-05-18 RECORD # : i10649104 LPATRON : 1010888 LCHKIN : 1998-01-03 # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 1 TOT RENEW : 0 Barcode : 3005000302605x CREATED : 1994-05-18 RECORD # : i10649116 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 3005000302610x CREATED : 1994-05-18 RECORD # : i10649128 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160082714 CREATED : 2016-05-13 RECORD # : i12977317 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 90594 90594 0 0 0 0 MAIN MAIN mnait 2026-08-18 0 AIT Thesis no. 1340 30050003026084 2026-08-18 17:37:35 2 2026-08-18 20 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no. 1340 3005000302605x 2026-08-18 17:37:35 3 2026-08-18 20 0 0 0 0 MAIN MAIN mnait 2026-08-18 0 AIT Thesis no. 1340 3005000302610x 2026-08-18 17:37:35 1 2026-08-18 20 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no. 1340 30050160082714 2026-08-18 17:37:35 2026-08-18 40