65 citations · 286 across the 25 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020★ 1 cited
Data-driven Algorithm for Scheduling with Total Tardiness
Michal Bouška, Antonín Novák, Přemysl Šůcha +2
In this paper, we investigate the use of deep learning for solving a classical NP-Hard single machine scheduling problem where the criterion is to minimize the total tardiness. Ins…
cs.AI2018★ 5 cited
Roster Evaluation Based on Classifiers for the Nurse Rostering Problem
Roman Václavík, Přemysl Šůcha, Zdeněk Hanzálek
The personnel scheduling problem is a well-known NP-hard combinatorial problem. Due to the complexity of this problem and the size of the real-world instances, it is not possible t…