discipline 
Mathematics, Applied
mathematics, Software Engineer

subject 
Scheduling

lecturers 
Tibor Jordán 
credits 

period 
1 or 3

curriculum 
Classification
of scheduling problems; onemachine scheduling,
priority rules (SPT, EDD, LCL), Hodgson algorithm, dynamic
programming, approximation algorithms, LP
relaxations. Parallel machines, list scheduling, LPT rule, Hu's
algorithm. Precedence constraints, preemption. Application of network flows and matchings. Shop models, Johnson's algorithm,
timetables, branch and bound, bin packing. 
literature 
P. Brucker: Scheduling algorithms, Springer,
2001. 
form of tuition 
Lectures 
mode of assessment 
written/oral exam 