-
13.01.2020, Wissenschaftliches Personal PhD position at the Chair of Algorithms and Complexity. Candidate shall work on approximation algorithms for scheduling problems in parallel and distributed
-
freedom and provide significant potential for increasing the efficiency in today’s train schedules. While this certainly provides a great deal of freedom and potential for improvements, utilizing
Searches related to scheduling algorithms
Enter an email to receive alerts for scheduling-algorithms positions