Courses Scheduling Problem at Junior High School with Integer Linear Programming.
Abstract
The course scheduling at junior high school is an important task. The purpose of course scheduling is to allocate courses according to their classification and to satisfy teachers preferences on teaching and other constraints. In this paper, the preferences and constraints are accommodated by means of coefficients as weights attached into courses as well as teachers. The problem is formulated as a minimization problem. The preferences and constraints with smaller weights framework indicate more preffered time periods, and vice versa. The scheduling problem in this paper is modeled in term of integer linear programming (ILP) and Lingo 8.0 is used to solve the problem. The result of the research is a fully defined schedule for “Masa Depan” junior high school.
Collections
- UT - Mathematics [1432]