Keywords

Heuristic programming, Production scheduling, Data processing

Abstract

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.

Notes

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

Graduation Date

Fall 1980

Advisor

Hosni, Yasser A.

Degree

Master of Science (M.S.)

College

College of Engineering

Degree Program

Engineering

Format

PDF

Pages

41 p.

Language

English

Rights

Public Domain

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Identifier

DP0013287

Subjects

Heuristic programming, Production scheduling -- Data processing

Collection (Linked data)

Retrospective Theses and Dissertations

Accessibility Status

Searchable text

Download

Included in

Engineering Commons

Share

COinS