Title page for ETD etd-07252009-202236

Type of Document Master's Thesis
Author Steeneck, Daniel Waymouth
URN etd-07252009-202236
Title Project Scheduling in the Presence of Productivity Functions
Degree Master of Science
Department Industrial and Systems Engineering
Advisory Committee
Advisor Name Title
Subash C. Sarin Committee Chair
Doug R. Bish Committee Member
Robert H. Sturges Committee Member
  • Project Planning
Date of Defense 2009-07-24
Availability unrestricted
The need for good quality project scheduling methods arises in many fields such as construction, manufacturing, and military operations, among others. In this thesis, we develop a solution methodology which determines the sequence in which the activities of the project must be processed and the resource allocation to each activity in the project to minimize the makespan of the project. We consider projects whose activities' durations are defined by convex, non-increasing time-resource trade-off functions and whose activities are not pre-emptable (i.e., once some amount of resource has been allocated to an activity, this resource level may not change while the activity is processed). The solution methodology first finds all potentially optimal sequences for a given project. However, rather than considering all possible sequences, we use special relationships between certain pairs activities to determine a priori how these pairs will be sequenced in relation to each other. Then, the optimal resource allocations are determine for each sequence and the solution with the smallest makespan is selected.
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  SteeneckThesis.pdf 1.64 Mb 00:07:34 00:03:53 00:03:24 00:01:42 00:00:08

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.