The Palacasan Tournament scheduling problem

Date

10-1992

Degree

Bachelor of Science in Agriculture

College

College of Agriculture and Food Science (CAFS)

Adviser/Committee Chair

Rolando G Panopio

Abstract

This paper considered the application of some applicable scheduling procedures that can be implemented in the Palacasan Tournament game scheduling. Scheduling procedures like Zero-one Integer Programming, Graph coloring and Grouping-Coloring were investigated in this study. The different necessary conditions that are being satisfied by the Palacasan’s present scheduling system were gathered and utilized to determine which among the considered algorithms would fit for the scheduling model. For scheduling the pairs of competing teams on each day of competition, Grouping-coloring approach was used, while for scheduling games on a given day, vertex coloring heuristics was implemented.

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