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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A classroom/time assignment model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Approach to Course Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: School Timetabling—A Case in Large Binary Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Interaction Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling activities among conflicting facilities to minimize conflict cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timetabling problem for university as assignment of activities to resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank

Latest revision as of 10:14, 19 June 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