Curriculum scheduling using Heuristic PERT

Dixon Ang Lao

Date

10-1987

Degree

Bachelor of Science in Applied Mathematics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Roland E. Ramos

Abstract

Heuristic programming utilizes of thumb or intuitive rules and guidelines and is generally under computer control to explore the most likely paths and to make educated guesses in arriving at a problem’s solution rather than going through all of the possible alternatives to obtain an optimum one. The PERT and the CPM, two known heuristic techniques, were modified and used for the B.S. in Applied Physics curriculum scheduling problem. Two networks were drawn, one a subgraph of the other, to make a distinction between the required courses and the prescribed electives. The basic critical path calculations were done by the computer program developed. A revised schedule that satisfies the network constraints, i. e., immediately preceding activities, the resource constraints such as number of units and hours for each semester and additional heuristics based on consultations was arrived at. A comparison between the revised and existing curriculums yielded many similarities and differences. However, the revised schedule was found to be more efficient and logical. Thus, a recommendation for the implementation of the new curriculum is hoped.

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

Thesis

Document Type

Thesis

This document is currently not available here.

Share

COinS