Results 21 to 30 of about 27,942 (261)
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +3 more sources
Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks [PDF]
Leibniz Transactions on Embedded SystemsElastic scheduling provides a framework under which the utilizations of recurrent tasks are reduced by increasing their periods in response to system overload. The original elastic scheduling model was proposed by Buttazzo et al.
Sudvarg, Marion +2 more
doaj +1 more source
A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy
The Scientific World Journal, 2013 Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and
Qiu Dishan, He Chuan, Liu Jin, Ma Manhao
doaj +1 more source
Analysis of usage of genetic and tabu search algorithms in shop scheduling
Lietuvos Matematikos Rinkinys, 2008 A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas +1 more
doaj +1 more source
AN IMPROVED QUANTUM SCHEDULING ALGORITHM [PDF]
International Journal of Foundations of Computer Science, 2003 The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by ∊N. Classically, it needs Ω(∊N log 2 N) bits of communication to find the common 1. The best known quantum algorithms require about [Formula: see text] qubits of communication.
openaire +2 more sources
应用气象学报The generation efficiency of data products depends on both the computational efficiency and the startup efficiency of algorithms. In meteorological operations, algorithms are typically data-driven, meaning they are initiated immediately upon data arrival
Huo Qing +5 more
doaj +1 more source
IET Communications, 2021 User scheduling algorithms in non‐orthogonal multiple access (NOMA) have attracted much attention to improve the performance of the communication system. Here, a low complexity user scheduling algorithm aimed for the maximum number of active users in the
Chengyi Liu, Geng Chen, Song Xing
doaj +1 more source
Scheduling distributed computations in non-deterministic systems
Научно-технический вестник информационных технологий, механики и оптикиComputation scheduling is very important in the design of distributed information processing and control systems. Effective scheduling algorithms allow developer to find technical solutions that are adequate to the existing constraints.
N. V. Kolesov +3 more
doaj +1 more source
Special Issue on Algorithms for Scheduling Problems
Algorithms, 2018 This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems
Frank Werner +2 more
doaj +1 more source
jMetal and MFHS Collaboration for Task Scheduling Optimization in Heterogeneous Distributed System
Journal of Innovative Applied Mathematics and Computational SciencesTask scheduling in distributed computing architectures has attracted considerable research interest, leading to the development of numerous algorithms aiming to approach optimal solutions.
Abdelhamid Khiat
doaj +1 more source