IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v96y2000i1p1-1610.1023-a1018930930672.html
   My bibliography  Save this article

Assigning students to course sections using tabu search

Author

Listed:
  • Ramon Alvarez-Valdes
  • Enric Crespo
  • Jose Tamarit

Abstract

In this paper we describe a new student registration system which has been developed at the University of Valencia, Spain. The system has two steps. First, the students make a computer-aided course selection from the courses available at the University. Thereafter, an assignment procedure allocates students to sections in order to respect two criteria: to provide the students with satisfactory schedules and to get balanced section enrollments. The assignment process has two phases. In Phase I, we obtain a set of the best solutions for each student. The algorithm is based on the construction of maximum cardinality independent sets. In Phase II, these solution sets are put together and a tabu search algorithm looks for a satisfactory balance between course sections without causing the solution obtained for each student to worsen significantly. The system was used at the beginning of the academic year 1996/97 in the Faculty of Mathematics and could be extended in the near future to the rest of the University. Copyright Kluwer Academic Publishers 2000

Suggested Citation

  • Ramon Alvarez-Valdes & Enric Crespo & Jose Tamarit, 2000. "Assigning students to course sections using tabu search," Annals of Operations Research, Springer, vol. 96(1), pages 1-16, November.
    • Handle: RePEc:spr:annopr:v:96:y:2000:i:1:p:1-16:10.1023/a:1018930930672
    DOI: 10.1023/A:1018930930672
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018930930672
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018930930672?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. David Schindl, 2019. "Optimal student sectioning on mandatory courses with various sections numbers," Annals of Operations Research, Springer, vol. 275(1), pages 209-221, April.
    2. Alvarez-Valdes, Ramon & Crespo, Enric & Tamarit, Jose M., 2002. "Design and implementation of a course scheduling system using Tabu Search," European Journal of Operational Research, Elsevier, vol. 137(3), pages 512-523, March.
    3. 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.
    4. Gartner, Daniel & Kolisch, Rainer, 2021. "Mathematical programming for nominating exchange students for international universities: The impact of stakeholders’ objectives and fairness constraints on allocations," Socio-Economic Planning Sciences, Elsevier, vol. 76(C).
    5. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.

    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:96:y:2000:i:1:p:1-16:10.1023/a:1018930930672. 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.