Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure
Year of publication: |
2019
|
---|---|
Authors: | Ermis, Gülcin ; Akkan, Can |
Published in: |
The practice and theory of automated timetabling (2016). - New York, NY, USA : Springer. - 2019, p. 101-121
|
Subject: | Scheduling-Verfahren | Scheduling problem | Linienverkehr | Scheduled transport | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Heuristik | Heuristics | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
Zhang, Defu, (2010)
-
Robust university course timetabling problem subject to single and multiple disruptions
Gülcü, Ayla, (2020)
-
Approaches to a real-world train timetabling problem in a railway node
Cacchiani, Valentina, (2016)
- More ...
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Improving schedule stability in single-machine rescheduling for new operation insertion
Akkan, Can, (2014)
-
Task-failure-driven rebalancing of disassembly lines
Altekin, F. Thevhide, (2012)
- More ...