IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v23y2015i2p355-358.html
   My bibliography  Save this article

Comments on: An overview of curriculum-based course timetabling

Author

Listed:
  • Edmund Burke
  • John Drake
  • Barry McCollum
  • Ender Özcan

Abstract

No abstract is available for this item.

Suggested Citation

  • Edmund Burke & John Drake & Barry McCollum & Ender Özcan, 2015. "Comments on: An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 355-358, July.
    • Handle: RePEc:spr:topjnl:v:23:y:2015:i:2:p:355-358
    DOI: 10.1007/s11750-015-0362-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-015-0362-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-015-0362-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Barry McCollum & Andrea Schaerf & Ben Paechter & Paul McMullan & Rhyd Lewis & Andrew J. Parkes & Luca Di Gaspero & Rong Qu & Edmund K. Burke, 2010. "Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 120-130, February.
    2. Barry McCollum & Edmund Burke, 2014. "The practice and theory of automated timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 1-2, July.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Arnaud Coster & Nysret Musliu & Andrea Schaerf & Johannes Schoisswohl & Kate Smith-Miles, 2022. "Algorithm selection and instance space analysis for curriculum-based course timetabling," Journal of Scheduling, Springer, vol. 25(1), pages 35-58, February.
    2. Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 313-349, July.
    3. Taha Arbaoui & Jean-Paul Boufflet & Aziz Moukrim, 2015. "Preprocessing and an improved MIP model for examination timetabling," Annals of Operations Research, Springer, vol. 229(1), pages 19-40, June.
    4. Sara Ceschia & Luca Di Gaspero & Andrea Schaerf, 2014. "The generalized balanced academic curriculum problem with heterogeneous classes," Annals of Operations Research, Springer, vol. 218(1), pages 147-163, July.
    5. Dennis S. Holm & Rasmus Ø. Mikkelsen & Matias Sørensen & Thomas J. R. Stidsen, 2022. "A graph-based MIP formulation of the International Timetabling Competition 2019," Journal of Scheduling, Springer, vol. 25(4), pages 405-428, August.
    6. Antony E. Phillips & Cameron G. Walker & Matthias Ehrgott & David M. Ryan, 2017. "Integer programming for minimal perturbation problems in university course timetabling," Annals of Operations Research, Springer, vol. 252(2), pages 283-304, May.
    7. Kahar, M.N.M. & Kendall, G., 2010. "The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution," European Journal of Operational Research, Elsevier, vol. 207(2), pages 557-565, December.
    8. Gerhard Post & Luca Gaspero & Jeffrey H. Kingston & Barry McCollum & Andrea Schaerf, 2016. "The Third International Timetabling Competition," Annals of Operations Research, Springer, vol. 239(1), pages 69-75, April.
    9. Felipe Rosa-Rivera & Jose I. Nunez-Varela & Cesar A. Puente-Montejano & Sandra E. Nava-Muñoz, 2021. "Measuring the complexity of university timetabling instances," Journal of Scheduling, Springer, vol. 24(1), pages 103-121, February.
    10. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    11. Emir Demirović & Nysret Musliu, 2017. "Modeling high school timetabling with bitvectors," Annals of Operations Research, Springer, vol. 252(2), pages 215-238, May.
    12. Michele Battistutta & Andrea Schaerf & Tommaso Urli, 2017. "Feature-based tuning of single-stage simulated annealing for examination timetabling," Annals of Operations Research, Springer, vol. 252(2), pages 239-254, May.
    13. Sabar, Nasser R. & Ayob, Masri & Kendall, Graham & Qu, Rong, 2012. "A honey-bee mating optimization algorithm for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 533-543.
    14. Dhananjay Thiruvady & Rhyd Lewis & Kerri Morgan, 2020. "Tackling the maximum happy vertices problem in large networks," 4OR, Springer, vol. 18(4), pages 507-527, December.
    15. 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.
    16. Gülcü, Ayla & Akkan, Can, 2020. "Robust university course timetabling problem subject to single and multiple disruptions," European Journal of Operational Research, Elsevier, vol. 283(2), pages 630-646.
    17. Lewis, R. & Song, X. & Dowsland, K. & Thompson, J., 2011. "An investigation into two bin packing problems with ordering and orientation implications," European Journal of Operational Research, Elsevier, vol. 213(1), pages 52-65, August.
    18. Can Akkan & Ayla Gülcü & Zeki Kuş, 2022. "Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation," Journal of Scheduling, Springer, vol. 25(4), pages 477-501, August.
    19. Clemens Nothegger & Alfred Mayer & Andreas Chwatal & Günther Raidl, 2012. "Solving the post enrolment course timetabling problem by ant colony optimization," Annals of Operations Research, Springer, vol. 194(1), pages 325-339, April.
    20. R. A. Oude Vrielink & E. A. Jansen & E. W. Hans & J. Hillegersberg, 2019. "Practices in timetabling in higher education institutions: a systematic review," Annals of Operations Research, Springer, vol. 275(1), pages 145-160, April.

    More about this item

    Statistics

    Access and download statistics

    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:topjnl:v:23:y:2015:i:2:p:355-358. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.