NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A branch-and-bound project assignment methodology with generalized network strategies for updating bounds
| dc.creator | Jittamai, Phongchai | |
| dc.date.accessioned | 2012-06-07T22:56:10Z | |
| dc.date.available | 2012-06-07T22:56:10Z | |
| dc.date.created | 1999 | |
| dc.date.issued | 1999 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1999-THESIS-J58 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references (leaves 49-50). | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.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. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | industrial engineering. | en |
| dc.subject | Major industrial engineering. | en |
| dc.title | A branch-and-bound project assignment methodology with generalized network strategies for updating bounds | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | industrial engineering | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.