Constraints of Availability in Timetabling and Scheduling
- 932 Downloads
The basic class–teacher timetabling problem is examined with the additional constraints due to the (un-)availability of source teachers and/or classes at some periods. We mention a generalization of this problem which occurs in image reconstruction problems in tomography. Complexity issues are discussed for both types of problems and some solvable cases are presented which can be derived from the image reconstruction formulation. Reductions to canonical forms are also described. Some other types of unavailability constraints (for classrooms or for lectures) are also reviewed.
KeywordsPolynomial Time Bipartite Graph Multiple Edge Parallel Edge Open Shop
Unable to display preview. Download preview PDF.
- 1.Asratian, A.S., de Werra, D.: A Generalized Class–Teacher Model for Some Timetabling Problems. Eur. J. Oper. Res. (2002) (to appear)Google Scholar
- 2.Asratian, A.S., Kamalian, R.R.: Interval Edge Coloring of Multigraphs. Appl. Math. Yerevan University 5, 21–34 (1987) (in Russian) Google Scholar
- 6.Costa, M.-C., de Werra, D., Picouleau, C.: On Some Image Reconstruction Problems (2002) (submitted) Google Scholar
- 8.Gabow, T., Nishizeki, O., Kariv, D., Leven, O., Terada, O.: Algorithms for Edge-Coloring Graphs. University of Colorado, Boulder (1983) (unpublished manuscript)Google Scholar