65 citations · 286 across the 25 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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…
cs.DS2016
The triangle scheduling problem
Christoph Dürr, Zdeněk Hanzálek, Christian Konrad +4
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality lev…