A PARTICULAR TIMETABLE PROBLEM: TERMINAL SCHEDULING

A timetable has to be constucted for ! identical machines, m users and n disjoint hours under the following conditions: a/Each machine has its working hours, a subset of the n disjoint hours. b/To each user belongs a number, the number of hours he would like to work and also the subset of horn's he is able to work on a machine. c/The users have other wishes: the set of hours is the ordered set of the hours of the week, and some of the users would like Ion g intervals of time, some others may want their time to be uniformly distributed within the week, etc. With the help of well known graph theoretic means, a good characterization for the feasibility of the basic problem defined by a/and b/ and a quick algorithm to solve this problem can be given. We will also show how some other requirements arising in practice can be built in our model (e.g. those mentioned in c/). This model can be considered as the common formulation of a class of problems arising in practice.