A Column Generation Scheme for Faculty Timetabling

نویسندگان

  • Andrea Qualizza
  • Paolo Serafini
چکیده

In this paper we deal with the problem of building a timetable for the courses of a university faculty. We propose an integer linear programming approach based on column generation. Each column is associated to a weekly timetable of a single course. The constraints referring to classroom occupancy and non overlapping in time of courses are in the integer linear programming matrix. The constraints and preferences related to a single course timetable are embedded in the column generation procedure. Generating a column for a course amounts to selecting the currently best time slots in the week. The interaction between the column generation procedure and the branch-and-bound method is also discussed. Some computational results are shown.

منابع مشابه

A column generation approach for examination timetabling

In examination timetabling we have to assign the exams of a given set of courses to time slots, such that conflicting exams are assigned to different time slots. We study the problem that occurs at our department. The characteristics of this problem are as follows. The exams have to take place in 5 days, and per day there are 2 time slots. Teachers can express their preferences for the time slo...

متن کامل

Strong bounds with cut and column generation for class-teacher timetabling

This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation algorithm to solve its linear relaxation is ...

متن کامل

Non-cyclic train timetabling and comparability graphs

We consider the customary formulation of non-cyclic train timetabling, calling for a maximumprofit collection of compatible paths in a suitable graph. The associated ILP models look for a maximum-weight clique in a(n exponentially-large) compatibility graph. By taking a close look at the structure of this graph, we analyze the existing ILP models and propose some new stronger ones, all having t...

متن کامل

An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007

Track 2 of the international timetabling competition 2007 was a post enrolment course timetabling problem. A set of events has to be assigned to a timeslot and to a room such that all students are able to attend their requested events while not violating the hard constraints. There are also soft constraints that make the timetable “nicer”. We present a deterministic heuristic that assigns event...

متن کامل

An Intelligent Anti-Islanding Scheme for Synchronous-Based Distributed Generation Using Reduced-Noise Morphological Gradient

This paper presents a pattern recognition-based scheme for detection of islanding conditions in synchronous- based distributed generation (DG) systems. The main idea behind the proposed scheme is the use of spatial features of system parameters such as the frequency, magnitude of positive sequence voltage, etc. In this study, the system parameters sampled at the point of common coupling (PCC) w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004