An analysis of the non-preemptive mixed-criticality match-up scheduling problem
Year of publication: |
October 2016
|
---|---|
Authors: | Hanzálek, Zdeněk ; Tunys, Tomáš ; Šůcha, Přemysl |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 5, p. 601-607
|
Subject: | Uncertain processing times | Scheduling | Complexity | Robustness | Mixed-criticality | ILP | Match-up | Packing | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time |
-
Scheduling with uncertain processing times in mixed-criticality systems
Novak, Antonin, (2019)
-
Scenario-based multi-objective robust scheduling for a semiconductor production line
Liu, Juan, (2019)
-
Match-up scheduling of mixed-criticality jobs : maximizing the probability of jobs execution
Seddik, Yasmina, (2017)
- More ...
-
A cyclic scheduling problem with an undetermined number of parallel identical processors
Šůcha, Přemysl, (2011)
-
A novel approach for nurse rerostering based on a parallel algorithm
Bäumelt, Zdeněk, (2016)
-
Optimizing energy consumption of robotic cells by a Branch & Bound algorithm
Bukata, Libor, (2019)
- More ...