=================================================
9:00 Welcome
9:30-10:00 Sotiris Kanellopoulos, NTUA & ARCHIMEDES
On finite variants of the pinwheel scheduling problem
10:00-10:30 Giorgos Mitropoulos, LIP6
What to Predict for Efficient Scheduling on Parallel Machines
10:30-11:00 Break
11:00-11:30 Aris Pagourtzis, NTUA & ARCHIMEDES
Subset Sum Problems with Applications to Fair Scheduling
11:30-12:00 Christos Pergaminelis, NTUA & ARCHIMEDES
Beer path problems in temporal graphs
12:00-14:00 Lunch
14:00-14:30 Martin Durand, LIP6
Multi-Organisation Scheduling: Individual Rationality and Complexity
14:30-15:00 Claire Hanen, LIP6
Parameterized Algorithm for scheduling precedence constrained jobs on parallel machines
15:00-15:30 Break
15:30-16:00 Vincent Chau, IBISC
Scheduling with Calibrations for Multi-Interval Jobs
16:00-16:30 Maher Mallem, G-SCOP
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Recherche Opérationnelle et Décision