Problems - Operations Research Models and Methods

Problems

Network Flow Programming Models

	Network Flow Programming Models
	- Class Scheduling

We have the problem of scheduling classes in a high school

Eight classes are to be offered. Every class must be taught.
There are four teachers and each teacher can teach a maximum of three classes. The lists below show the classes that each teacher can teach.

Teacher 1: C1, C2, C3, C4.

Teacher 2: C2, C4, C6, C8.

Teacher 3: C1, C3, C5, C7.

Teacher 4: C5, C6, C7, C8.

There are six periods in the day with two rooms. No more than one class can be scheduled in a room at a time.
A teacher can teach only one class at a time.

Construct and solve a network flow model that can be used to assign classes to teachers and teachers to periods.