Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
Year of publication: |
2019
|
---|---|
Authors: | Arbaoui, Taha ; Boufflet, Jean-Paul ; Moukrim, Aziz |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 106.2019, p. 133-142
|
Subject: | Examination timetabling problems | Spacing soft constraints | Lower bounds | Compact mathematical formulation | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Job shop scheduling with the option of jobs outsourcing
Safarzadeh, Hamid, (2019)
-
An exact algorithm for the Blocks Relocation Problem with new lower bounds
Quispe, Kent E. Yucra, (2018)
-
Improved lower bounds for the online bin stretching problem
Gabay, Michaƫl, (2017)
- More ...
-
Preprocessing and an improved MIP model for examination timetabling
Arbaoui, Taha, (2015)
-
An exact optimization method based on dominance properties for the design of AS/RSs
Hamzaoui, Mohammed A., (2021)
-
Rodoplu, Melek, (2020)
- More ...