65 citations · 286 across the 25 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024★ 24 cited
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
Michal Bouška, Přemysl Šůcha, Antonín Novák +1
In this paper, we investigate the use of the deep learning method for solving a well-known NP-hard single machine scheduling problem with the objective of minimizing the total tard…
math.OC2016★ 1 cited
On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels
Antonin Novak, Premysl Sucha, Zdenek Hanzalek
In this paper, we study an NP-hard problem of a single machine scheduling minimizing the makespan, where the mixed-critical tasks with an uncertain processing time are scheduled. W…