Семинар «Актуальные проблемы теории расписаний»

Federico Della Croce (DIGEP - Polito.it)
The Longest Processing Time Rule for Identical Parallel Machines Revisited.

Leah Epstein (University of Haifa)
The Benefit of Preemption.

Nicholas G. Hall (The Ohio State University)
Dynamic Opponent Choice in Tournaments.

Andrea Schaerf (University of Udine)
Educational Timetabling: Problems, Benchmarks, Algorithms, and Practical Issues.

Michael Carter (University of Toronto)
Challenges in Healthcare Scheduling Applications.

Jinjiang Yuan (Zhengzhou Univ)
Updated complexity results in single-machine primary-secondary scheduling. for min. two regular criteria.

Martin Skutella (TU Berlin)
Efficient Algorithms and Provably Good Solutions for NP-hard Scheduling Problems.