Heuristic programming, Production scheduling, Data processing
This report examines the widely acceptable Heuristic and Exact procedures for solving the problem of project scheduling and control under constrained resources. Heuristic approaches are more practical, however they depend on the type of the project as well as the resources involved. Exact procedures are illustrated using an Integer Linear Programming formulation of the problem, and also solving it using the Branch and Bound Technique. Impracticality of the exact methods stews from the fact that the computations expand to an unmanageable amount.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Hosni, Yasser A.
Master of Science (M.S.)
College of Engineering
iv, 41 pages
Length of Campus-only Access
Masters Thesis (Open Access)
Heuristic programming, Production scheduling -- Data processing
Benameur, Mohammed, "Project Scheduling Under Constrained Resources" (1980). Retrospective Theses and Dissertations. 465.