School Timetabling---A Case in Large Binary Integer Linear Programming
AbstractA timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special ordered sets of variables. We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 30 (1984)
Issue (Month): 12 (December)
programming: integer; applications; Lagrangean relaxation;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
- Asratian, A. S. & de Werra, D., 2002. "A generalized class-teacher model for some timetabling problems," European Journal of Operational Research, Elsevier, vol. 143(3), pages 531-542, December.
- Haase, Knut & Latteier, Jorg & Schirmer, Andreas, 1998. "The course scheduling problem at Lufthansa Technical Training," European Journal of Operational Research, Elsevier, vol. 110(3), pages 441-456, November.
- Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
- Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
- Boronico, Jess, 2000. "Quantitative modeling and technology driven departmental course scheduling," Omega, Elsevier, vol. 28(3), pages 327-346, June.
- Lin, Edward Y. H. & Bricker, Dennis L., 1996. "Computational comparison on the partitioning strategies in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 88(1), pages 182-202, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.