Date of Award


Degree Type


Degree Name

Master of Science in Industrial Engineering (MSIE)


Industrial Engineering

First Advisor

David M. Shao


A heuristic scheduling routine was developed in this study for scheduling the activities of a project-network. The objectives of the scheduling process are to minimize the daily allocation of resources, satisfy constraints on the availability of resources, and achieve total completion of the project within a given due date.

Since this type of a problem is a large combinatorial one, an analytical solution is almost impossible, and always impractical, even for small project-networks.

The scheduling procedure developed in this study consists of a series of computations and heuristic decisions based on functional properties of the networks and assembled into a logical sequence of steps designed to originate successive schedules that converge toward the optimal or near-optimal solution.

The heuristic scheduling routine was tested with several artificially prepared project-networks for which the optimal solutions were already known. Either the originally prepared optimal schedules or resource equivalent ones were obtained.

The solution of this problem will find real-life applications in the maintenance functions of varying industrial organizations, and in the construction industry among others.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.