Development and evaluation of a network scheduling procedure based on utility theory.

Bibliographic Details
Main Author: Taylor, James Marcus
Other Authors: Layman (degree committee member.)
Format: Thesis Book
Language:English
Published: 1981.
Subjects:
Online Access:Link to ProQuest Copy
Link to OAKTrust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000ctm a2200000Ia 4500
001 in00000086729
005 20220104090729.0
008 820922s1981 xx a bm 000 0 eng d
035 |9 AAK0829AM 
035 |a (OCoLC)08794533 
035 |a (OCoLC)8794533 
035 |a (OCoLC)ocm08794533 
040 |a TXA  |b eng  |c TXA  |d OCLCQ  |d OCLCF  |d OCLCO  |d OCLCQ  |d UMI  |d TXA  |d UtOrBLW 
049 |a TXAM 
099 |a 1981  |a Dissertation  |a T243 
100 1 |a Taylor, James Marcus. 
245 1 0 |a Development and evaluation of a network scheduling procedure based on utility theory. 
264 1 |c 1981. 
300 |a xi, 226 leaves :  |b illustrations ;  |c 29 cm 
336 |a text  |b txt  |2 rdacontent 
337 |a unmediated  |b n  |2 rdamedia 
338 |a volume  |b nc  |2 rdacarrier 
500 |a "Major subject: Civil Engineering." 
500 |a Typescript (photocopy). 
500 |a Vita. 
502 |b Ph. D. in Philosophy  |c Texas A & M University  |d 1981 
504 |a Includes bibliographical references (leaves 222-225). 
520 3 |a Activity networks have been widely used in the planning, management, and control of building construction projects since their introduction in the 1950s. As the popularity of activity networking procedures has grown, so has the theory underlying the various procedures. Procedures are presently available that consider both technological and non-technological constraints and offer solutions solved optimally or heuristically. However, activity networks typical of building construction projects have not lent themselves to efficient optimal solutions because of their size, complexity, and diversity. Therefore, various heuristic scheduling procedures have been developed to solve this class of problem pragmatically if not optimally. A disadvantage to the heuristic scheduling schemes available is that they follow a set of rigid heuristics and therefore may not be sensitive to a variety of differing network types or a variety of constraints. This study undertakes the development of a scheduling procedure that is heuristically based but that is sensitive to any variety of network types or constraints imposed by the scheduler. This is accomplished by combining all pertinent factors through a utility analysis and scheduling each activity based on the results of this analysis. The factors that are considered pertinent for the purpose of this study are the activity times based on technological constraints, network complexity, resource usage and availability, resource unit cost, and total activity cost. These factors are combined through the use of an additive utility model and prioritized to yield a scheduling sequence. Four different activity networks are tested under a variety of resource constraints and resource limitations. The resulting schedules are evaluated based on their relative performance and on their comparative performance against schedules generated by another heuristic procedure and by an optimum procedure. 
650 0 |a Construction industry  |x Management.  |0 http://id.loc.gov/authorities/subjects/sh85031411 
650 0 |a Network analysis (Planning)  |0 http://id.loc.gov/authorities/subjects/sh85091074 
650 4 |a Civil Engineering. 
655 7 |a Academic theses.  |2 lcgft  |0 http://id.loc.gov/authorities/genreForms/gf2014026039 
700 0 |a Layman,  |e degree committee member.  |0 http://id.loc.gov/authorities/names/n85817527 
710 2 |a Texas A & M University,  |e degree granting institution.  |0 http://id.loc.gov/authorities/names/n80125885 
856 4 1 |u http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=749776751&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD  |z Link to ProQuest Copy  |t 0 
856 4 1 |u https://hdl.handle.net/1969.1/DISSERTATIONS-94419  |z Link to OAKTrust copy  |t 0 
994 |a C0  |b TXA 
999 f f |s 5226b220-1eef-3399-abca-ad35992f373e  |i d9067307-8347-3f5d-a687-0a5e53754758  |t 0 
952 f f |p noncirc  |a Texas A&M University  |b J.J. Pickle Campus  |c High Density Repository  |s HDR  |d Remote Storage  |t 0  |e 1981 Dissertation T243  |h Other scheme  |i unmediated -- volume  |m A14841004476 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e 1981 Dissertation T243  |h Other scheme 
998 f f |a 1981 Dissertation T243  |t 0  |l Available Online 
998 f f |a 1981 Dissertation T243  |t 0  |l Remote Storage