A large scale timetabling problem (Q1112719): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(89)90053-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025084346 / rank
 
Normal rank

Revision as of 20:46, 19 March 2024

scientific article
Language Label Description Also known as
English
A large scale timetabling problem
scientific article

    Statements

    A large scale timetabling problem (English)
    0 references
    0 references
    0 references
    1989
    0 references
    This problem has two main components. In the timetabling subproblem a master timetable is derived taking into account student registrations and lecturer and classroom availabilities. The grouping subproblem specifies groups of students for large courses that have to be repeated several times during the week. In this paper we propose an approach to handle both subproblems and to deal with their strong relationship. The solution approach includes several heuristic procedures to handle the subproblems which are formulated as assignment type problems in which entities are assigned to resources by using penalty terms for conflicts and excessive use of classrooms. Finally numerical results are also reported.
    0 references
    timetabling
    0 references
    heuristic
    0 references
    assignment
    0 references

    Identifiers