Abstract
One of the principal components of procedures for the solution of class-teacher timetable problems is that for maintenance of the opportunity list. Opportunity list maintenance methods are based on necessary conditions for the existence of a solution. A general framework for necessary conditions, together with four specific sets of necessary conditions, is given.
- 1 Csima, J., and Gotlieb, C.C. tests on a computer methods for constructing school timetables. Comm. ACM 7, 3 (Mar. 1964), 160- 163. Google ScholarDigital Library
- 2 De Werra, D. Construction of school timetables by flow methods. Working Paper No. 10, Dept. of Management Sciences, U. of Waterloo, Ont., 1969.Google Scholar
- 3 Gotlieb, C. The construction of class-teacher timetables. Proc. IFIP Cong. 1962, North-Holland Pub. Co., Amsterdam, pp 73-77.Google Scholar
- 4 Haley, K.B. A note on the letter by Morivek and Vlach. Opns. Res. 15 (1967), 545-546.Google ScholarDigital Library
- 5 Hall, P. On representatives of subsets. J. Lond. Math. Soc., 10 (1935), 26-30.Google ScholarCross Ref
- 6 Lions, J. Matrix reduction using the Hungarian method for the generation of school timetables. Comm. ACM 9, 5 (May 1966), 349-354. Google ScholarDigital Library
- 7 Lions, J. The Ontario school scheduling program. Comput. J. 10 (1967), 14-21.Google ScholarCross Ref
- 8 Lions, J. A generalisation of a method for the construction of class/teacher timetables. Proc. IF1P Cong. 1968, North-Holland Pub. Co., Amsterdam, pp G68-G72.Google Scholar
- 9 Moravek, J., and Vlach, M. On the necessary conditions for the existence of a solution of the multi-index problem. Opns. Res. 15 (1967), 542-545.Google ScholarDigital Library
- 10 Sefton, I.M. Generation of academic timetables by computer. M. Sc. Th., U. of Sydney, Australia, 1970.Google Scholar
- 11 Smith, G. The construction by computer of a university departmental timetable. M. Eng. Sc. Th., U. of New South Wales, Sydney, Australia, 1968.Google Scholar
Index Terms
- On maintenance of the opportunity list for class-teacher timetable problems
Recommendations
On Lion's counter example for Gotlieb's method for the construction of school timetables
The timetable problem is an essentially discrete problem. Although the discrete problem may have no feasible solution, there may exist a solution to the equivalent continuous problem. An example, is given, for which the nondiscrete solution can be ...
The Riccati Equation for Optimal Control Problems with Mixed State-Control Constraints: Necessity and Sufficiency
The goal of this paper is to conduct a complete study of second-order conditions for the optimal control problem with mixed state-control constraints. The conjugate point theory is presented and a necessary condition in terms of the corresponding ...
Filter banks with maximum coding gain and energy compaction
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)We derive a set of necessary and sufficient conditions for maximizing the coding gain in an orthonormal filter bank. These are referred to as the decorrelation and majorization conditions. While each condition individually is only necessary and not ...
Comments