Scheduling Algorithms

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 algorithms for scheduling.

Study Programmes

Postgraduate doctoral study programme


Joseph Y-T. Leung (2004.), Handbook of Scheduling, CRC Press
Andrew Kusiak (1986.), Flexible Manufacturing Systems, North Holland
Michael Pinedo (2008.), Scheduling, Springer Science & Business Media
Jane W. S. Liu (2001.), Real-Time Systems, Prentice Hall

For students


ID 154832
  Summer semester
L1 English Level
L1 e-Learning