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

Rejoinder on: an overview of curriculum-based course timetabling

Author

Listed:
  • Andrea Bettinelli
  • Valentina Cacchiani
  • Roberto Roberti
  • Paolo Toth

Abstract

No abstract is available for this item.

Suggested Citation

  • Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "Rejoinder 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 366-368, July.
  • Handle: RePEc:spr:topjnl:v:23:y:2015:i:2:p:366-368
    DOI: 10.1007/s11750-015-0367-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-015-0367-y
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11750-015-0367-y?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cristian D. Palma & Patrick Bornhardt, 2020. "Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem," Mathematics, MDPI, vol. 8(10), pages 1-12, October.
    2. 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.
    3. Alexander Kiefer & Richard F. Hartl & Alexander Schnell, 2017. "Adaptive large neighborhood search for the curriculum-based course timetabling problem," Annals of Operations Research, Springer, vol. 252(2), pages 255-282, May.
    4. Alexandre Lemos & Pedro T. Monteiro & Inês Lynce, 2021. "Disruptions in timetables: a case study at Universidade de Lisboa," Journal of Scheduling, Springer, vol. 24(1), pages 35-48, February.
    5. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    6. 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.
    7. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.
    8. Seizinger, Markus & Brunner, Jens O., 2023. "Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1223-1241.
    9. Bagger, Niels-Christian F. & Sørensen, Matias & Stidsen, Thomas R., 2019. "Dantzig–Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling," European Journal of Operational Research, Elsevier, vol. 272(2), pages 430-446.
    10. Michael Lindahl & Matias Sørensen & Thomas R. Stidsen, 2018. "A fix-and-optimize matheuristic for university timetabling," Journal of Heuristics, Springer, vol. 24(4), pages 645-665, August.
    11. Lindahl, Michael & Mason, Andrew J. & Stidsen, Thomas & Sørensen, Matias, 2018. "A strategic view of University timetabling," European Journal of Operational Research, Elsevier, vol. 266(1), pages 35-45.
    12. Niels-Christian Fink Bagger & Guy Desaulniers & Jacques Desrosiers, 2019. "Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem," Journal of Scheduling, Springer, vol. 22(2), pages 155-172, April.
    13. Efstratios Rappos & Eric Thiémard & Stephan Robert & Jean-François Hêche, 2022. "A mixed-integer programming approach for solving university course timetabling problems," Journal of Scheduling, Springer, vol. 25(4), pages 391-404, August.
    14. 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.
    15. 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.
    16. Mutsunori Banbara & Katsumi Inoue & Benjamin Kaufmann & Tenda Okimoto & Torsten Schaub & Takehide Soh & Naoyuki Tamura & Philipp Wanko, 2019. "$${\varvec{teaspoon}}$$ teaspoon : solving the curriculum-based course timetabling problems with answer set programming," Annals of Operations Research, Springer, vol. 275(1), pages 3-37, April.
    17. Niels-Christian F. Bagger & Simon Kristiansen & Matias Sørensen & Thomas R. Stidsen, 2019. "Flow formulations for curriculum-based course timetabling," Annals of Operations Research, Springer, vol. 280(1), pages 121-150, September.
    18. Lindahl, Michael & Stidsen, Thomas & Sørensen, Matias, 2019. "Quality recovering of university timetables," European Journal of Operational Research, Elsevier, vol. 276(2), pages 422-435.
    19. Rasmus Ø. Mikkelsen & Dennis S. Holm, 2022. "A parallelized matheuristic for the International Timetabling Competition 2019," Journal of Scheduling, Springer, vol. 25(4), pages 429-452, August.

    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:366-368. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.