IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_20.html
   My bibliography  Save this book chapter

Optimal Student Sectioning at Niederrhein University of Applied Sciences

In: Operations Research Proceedings 2019

Author

Listed:
  • Steffen Goebbels

    (Niederrhein University of Applied Sciences)

  • Timo Pfeiffer

    (Niederrhein University of Applied Sciences)

Abstract

Degree programs with a largely fixed timetable require centralized planning of student groups (sections). Typically, group sizes for exercises and practicals are small, and different groups are taught at the same time. To avoid late or weekend sessions, exercises and practicals of the same or of different subjects can be scheduled concurrently, and the duration of lessons can vary. By means of an integer linear program, an optimal group division is carried out. To this end, groups have to be assigned to time slots and students have to be divided into groups such that they do not have conflicting appointments. The optimization goal is to create homogeneous group sizes.

Suggested Citation

  • Steffen Goebbels & Timo Pfeiffer, 2020. "Optimal Student Sectioning at Niederrhein University of Applied Sciences," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 167-173, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_20
    DOI: 10.1007/978-3-030-48439-2_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Timetabling; Integer linear programming;

    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:oprchp:978-3-030-48439-2_20. 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.