Abstract
The objective of this thesis is to develop a branch-and-bound procedure to accommodate the generalized network model for project assignment problems. The solution from this algorithm yields the optimal solution with binary flows in the network. This approach can be used as a decision-support methodology especially for the state highway department to allocate the road maintenance problem in order to maximize the total benefit without breaking the availability of two types of resources, manpower and budget. This procedure is coded in FORTRAN 90. Five problem sets containing the number of projects from 10 to 50 were run. The results show that the availability of resources and the number of projects in the problem set have significant effects on the computation time and the number of iterations. Due to the run time of the computer and the number of iterations that increase enormously as the number of projects increased, this code is recommended for solving problems with small to medium size of slumber of projects.
Jittamai, Phongchai (1999). A branch-and-bound project assignment methodology with generalized network strategies for updating bounds. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1999 -THESIS -J58.