Scheduling Algorithms
Data is displayed for the academic year: 2024./2025.
Course Description
Algorithm time complexity. NP-complete and NP-hard problems. Fundamental scheduling algorithms with goals to minimize makespan, maximum tardiness, total tardiness and number of late jobs. The traditional scheduling problems: parallel uniform machines, parallel unrelated machines, flow shop, job shop, open shop, etc. Stochastic optimization and machine learning algorithms for scheduling.
Study Programmes
Postgraduate doctoral study programme
Literature
General
ID 154832
Summer semester
6 ECTS
L1 e-Learning