Local search and constraint programming for the post enrolment-based course timetabling problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-010-0737-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- de Werra, D., 1985. "An introduction to timetabling," European Journal of Operational Research, Elsevier, vol. 19(2), pages 151-162, February.
- Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.
- Lewis, R. & Thompson, J., 2015. "Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem," European Journal of Operational Research, Elsevier, vol. 240(3), pages 637-648.
- Soria-Alcaraz, Jorge A. & Ochoa, Gabriela & Sotelo-Figeroa, Marco A. & Burke, Edmund K., 2017. "A methodology for determining an effective subset of heuristics in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 260(3), pages 972-983.
- Kadri Sylejmani & Edon Gashi & Adrian Ymeri, 2023. "Simulated annealing with penalization for university course timetabling," Journal of Scheduling, Springer, vol. 26(5), pages 497-517, October.
- W. Jaśkowski & M. Szubert & P. Gawron, 2016. "A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 33-62, July.
- Say Leng Goh & Graham Kendall & Nasser R. Sabar & Salwani Abdullah, 2020. "An effective hybrid local search approach for the post enrolment course timetabling problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1131-1163, December.
- Goh, Say Leng & Kendall, Graham & Sabar, Nasser R., 2017. "Improved local search approaches to solve the post enrolment course timetabling problem," European Journal of Operational Research, Elsevier, vol. 261(1), pages 17-29.
- Ghaith Jaradat & Masri Ayob & Zulkifli Ahmad, 2014. "On the performance of Scatter Search for post-enrolment course timetabling problems," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 417-439, April.
- Fabian Dunke & Stefan Nickel, 2023. "A matheuristic for customized multi-level multi-criteria university timetabling," Annals of Operations Research, Springer, vol. 328(2), pages 1313-1348, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Jagota, Arun, 1996. "An adaptive, multiple restarts neural network algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 93(2), pages 257-270, September.
- Michael R. Miller & Robert J. Alexander & Vincent A. Arbige & Robert F. Dell & Steven R. Kremer & Brian P. McClune & Jane E. Oppenlander & Joshua P. Tomlin, 2017. "Optimal Allocation of Students to Naval Nuclear-Power Training Units," Interfaces, INFORMS, vol. 47(4), pages 320-335, August.
- Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "Pre-processing techniques for resource allocation in the heterogeneous case," European Journal of Operational Research, Elsevier, vol. 107(2), pages 470-491, June.
- John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
- Gerhard Post & Samad Ahmadi & Sophia Daskalaki & Jeffrey Kingston & Jari Kyngas & Cimmo Nurmi & David Ranson, 2012. "An XML format for benchmarks in High School Timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 385-397, April.
- Amine Lamine & Mahdi Khemakhem & Brahim Hnich & Habib Chabchoub, 2016. "Solving constrained optimization problems by solution-based decomposition search," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 672-695, October.
- Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
- Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
- De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
- Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
- Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
- Roberto Rossi & S. Armagan Tarim & Brahim Hnich & Steven Prestwich & Semra Karacaer, 2010. "Scheduling internal audit activities: a stochastic combinatorial optimization problem," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 325-346, April.
- Pascal Van Hentenryck, 2002. "Constraint and Integer Programming in OPL," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 345-372, November.
- Riise, Atle & Mannino, Carlo & Lamorgese, Leonardo, 2016. "Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling," European Journal of Operational Research, Elsevier, vol. 255(3), pages 719-728.
- C Beyrouthy & E K Burke & D Landa-Silva & B McCollum & P McMullan & A J Parkes, 2009. "Towards improving the utilization of university teaching space," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 130-143, January.
- Luca Benini & Michele Lombardi & Michela Milano & Martino Ruggiero, 2011. "Optimal resource allocation and scheduling for the CELL BE platform," Annals of Operations Research, Springer, vol. 184(1), pages 51-77, April.
- Wheatley, David & Gzara, Fatma & Jewkes, Elizabeth, 2015. "Logic-based Benders decomposition for an inventory-location problem with service constraints," Omega, Elsevier, vol. 55(C), pages 10-23.
- Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
- R Qu & E K Burke, 2009. "Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1273-1285, September.
- S. Tarim & Brahim Hnich & Steven Prestwich & Roberto Rossi, 2009. "Finding reliable solutions: event-driven probabilistic constraint programming," Annals of Operations Research, Springer, vol. 171(1), pages 77-99, October.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:111-135:10.1007/s10479-010-0737-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.