Prohlížení Publikační činnost ČVUT dle předmětu "Scheduling"
Zobrazují se záznamy 1-6 z 6
-
Computing the execution probability of jobs with replication in mixed-criticality schedules
(Springer, 2022)Mixed-criticality scheduling addresses the problem of sharing common resources among jobs of different degrees of criticality and uncertain processing times. The processing time of jobs is observed during the online execution ... -
Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers
(Elsevier, 2022)This paper examines scheduling problem denoted as P|(seq), ser|C(max )in Graham's notation; in other words, scheduling of tasks on parallel identical machines (P) with sequence-dependent setups (seq) each performed by one ... -
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
(Elsevier B.V., 2023)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 tardiness. We propose a deep neural network ... -
Makespan minimization of Time-Triggered traffic on a TTEthernet network
(IEEE, 2017)The reliability of the increasing number of modern applications and systems strongly depends on interconnecting technology. Complex systems which usually need to exchange, among other things, multimedia data together with ... -
Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances
(Elsevier B.V., 2022)This paper addresses a single machine scheduling problem minimizing the weighted number of tardy jobs, where each job is characterized by processing time, due date, deadline, and weight. It is known from the existing ... -
Scheduling with uncertain processing times in mixed-criticality systems
(Elsevier, 2019)Many scheduling problems that can be identified inside safety-critical applications, such as in autonomous cars, tend to be mixed-critical. Such scheduling problems consider tasks to have different criticalities depending ...