Parallel local search algorithms for high school timetabling problems
| Year of publication: |
16 February 2018
|
|---|---|
| Authors: | Saviniec, Landir ; Santos, Maristela Oliveira ; Costa, Alysson Machado |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 1 (16.2.), p. 81-98
|
| Subject: | Timetabling | Parallel metaheuristics | Iterated local search | Tabu search | Simulated annealing | Heuristik | Heuristics | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Suchtheorie | Search theory | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem |
-
Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno, (2021)
-
Improved local search approaches to solve the post enrolment course timetabling problem
Say Leng Goh, (2017)
-
Stochastic local search and parameters recommendation : a case study on flowshop problems
Pavelski, Lucas M., (2023)
- More ...
-
Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems
Saviniec, Landir, (2020)
-
Multiskilled workforce staffing and scheduling : a logic-based Benders' decomposition approach
Nasirian, Araz, (2025)
-
Network scheduling problem with cross-docking and loading constraints
Castellucci, Pedro B., (2021)
- More ...