- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Resource leveling and linear scheduling
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Resource leveling and linear scheduling Dubey, Ashish
Abstract
Resource leveling in the context of linear scheduling has been explored in this thesis. Multilocation projects such as high rise construction, bridges and so forth have special characteristics which should be taken into account in resource leveling procedures - e.g., flow line characteristics should be maintained or a specified location execution sequence must be followed. The Minimum Moment Algorithm for resource leveling by Harris has been used as a starting point to develop a modified algorithm to treat linear scheduling. Further modifications have been made to accommodate activities with variable resource usage profiles. The new algorithm has been named the "Modified Minimum Moment Algorithm". The research version of the REPCON Construction management information System has been used for the testing of the algorithm. The multilocation activity modeling structures of REPCON have been used to define linear activity types. One constraint on the leveling algorithm is that these activity types must maintain their attributes when subjected to leveling, e.g., a continuous activity must maintain free float equal to zero between its intermediate locations and the ordered activity must follow the specified location sequence. The algorithm has been programmed and tested on several examples. Resource histograms
Item Metadata
Title |
Resource leveling and linear scheduling
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1993
|
Description |
Resource leveling in the context of linear scheduling has been explored in this thesis. Multilocation projects such as high rise construction, bridges and so forth have special characteristics which should be taken into account in resource leveling procedures - e.g., flow line characteristics should be maintained or a specified location execution sequence must be followed.
The Minimum Moment Algorithm for resource leveling by Harris has been used as a starting point to develop a modified algorithm to treat linear scheduling. Further modifications have been made to accommodate activities with variable resource usage profiles. The new algorithm has been named the "Modified Minimum Moment Algorithm".
The research version of the REPCON Construction management information System has been used for the testing of the algorithm. The multilocation activity modeling structures of REPCON have been used to define linear activity types. One constraint on the leveling algorithm is that these activity types must maintain their attributes when subjected to leveling, e.g., a continuous activity must maintain free float equal to zero between its intermediate locations and the ordered activity must follow the specified location sequence. The algorithm has been programmed and tested on several examples. Resource histograms
|
Extent |
12088190 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Notes |
Page iii of Abstract missing
|
Date Available |
2008-09-05
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0050448
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1993-11
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.