По вашему запросу найдено документов: 1485
Страница 4 из 149
A general scheme for solving an NP-hard problem in the strong sense of the scheduling theoryThe well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal
Minimizing functions of infeasibilities in a two-machine flow shopWe consider a class of schedules obtained in the following way. In a
schedule
Models for periodic task scheduling based on combining data processing cycles to support the onboard navigation and control system of a UAV study to identify the criterion for the quality of obtained schedules. © 2019 IEEE.
NP-Hard task schedules and methods of its decisionMethods of solving the problem of the schedule problem are examined, the advantages
A method for synthesis of specialized processors to support on-board scheduling of periodic tasks task scheduling to support autonomous functioning of a small UAV having limited computing resources. A
Multilevel central trust management approach for task scheduling on iot‐based mobile cloud computing, which implies and demands the need to shift to fog computing. Task scheduling is one of the most
Web-система "Schedule" - сервис для составления расписанияWeb-система "Schedule" - сервис для составления расписания
The model and the task of building industrial and medical processesThe problem of construction scheduling process in order to optimize the flow of service requests
Two-machine shop scheduling with zero and unit processing timesTwo-machine shop scheduling with zero and unit processing times
Parallel machine scheduling models with the total machine costParallel machine scheduling models with the total machine cost
Страница 4 из 149
Фасеты
Партнеры
Индексация
