Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
-
Field
-
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
-
, storage and demand. YOUR TASKS You will develop mathematical models and metaheuristic algorithms for complex optimization problems in the context described above, see e.g., https://arxiv.org/abs/2503.01325
Searches related to scheduling algorithms
Enter an email to receive alerts for scheduling-algorithms positions