Finding near optimal solutions to the thesis defense timetabling problem by exploiting symmetries
Year of publication: |
2024
|
---|---|
Authors: | Dimitsas, Angelos ; Gogos, Christos |
Published in: |
Operations research forum. - Cham : Springer International Publishing, ISSN 2662-2556, ZDB-ID 2978290-9. - Vol. 5.2024, 3, Art.-No. 65, p. 1-19
|
Subject: | Scheduling | Constraint Programming | Symmetries | Thesis Defense Timetabling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Kinable, Joris, (2014)
-
Temporal linear relaxation in IBM ILOG CP optimizer
Laborie, Philippe, (2016)
-
Parallel machine scheduling with tool loading : a constraint programming approach
Gökgür, Burak, (2018)
- More ...
-
Which algorithm to select in sports timetabling?
Van Bulck, David, (2024)
-
A systematic two phase approach for the nurse rostering problem
Valouxis, Christos, (2012)
-
A systematic two phase approach for the nurse rostering problem
Valouxis, Christos, (2012)
- More ...