Results 21 to 30 of about 1,841,225 (287)

Special Issue on Exact and Heuristic Scheduling Algorithms

Algorithms, 2019
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms.
Frank Werner, Larysa Burtseva, Yuri N. Sotskov   +2 more
doaj   +1 more source

Heuristic initialization of PSO task scheduling algorithm in cloud computing

Journal of King Saud University: Computer and Information Sciences, 2022
Task scheduling is one of the major issues in cloud computing environment. Efficient task scheduling is substantial to attain cost-effective execution and improve resource utilization.
Seema A. Alsaidy, Amenah D. Abbood, Mouayad A. Sahib   +2 more
doaj   +1 more source

A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING [PDF]

International Journal of Computational Geometry & Applications, 2011
This article develops an algorithm for a group of guards statically positioned in a non-convex polygonal environment with holes. Each guard possesses a single searchlight, a ray sensor which can rotate about the guard's position but cannot penetrate the boundary of the environment.
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo   +2 more
openaire   +2 more sources

A hybrid chemical reaction optimization scheme for task scheduling on heterogeneous computing systems [PDF]

, 2015
An application consisting of a group of tasks can be represented by a node- and edge-weighted directed acyclic graph (DAG), in which the vertices represent the computations and the directed edges represent the data dependencies as well as the ...
Xu, Yuming, Li, Keqin, Li, Kenli, He, Ligang, Zhang, Longxin   +4 more
core   +1 more source

Comparative Study of Intelligent Scheduling Algorithms for Heterogeneous Systems [PDF]

IJCI International Journal of Computers and Information
Scheduling tasks in a heterogeneous computing environment can be a challenging problem due to the diverse range of hardware and software resources available. In this comparative study different approaches are investigated for solving multitask scheduling
Abla Elsayed, osama Abdel Raouf, Mohy Hadhoud, Ahmed Kafafy   +3 more
doaj   +1 more source

An upgraded fruit fly optimisation algorithm for solving task scheduling and resource management problem in cloud infrastructure

IET Networks, 2021
In this manuscript, an upgraded Fruit Fly Optimization Algorithm (FFOA) is proposed for optimising task scheduling and resource management processes. The proposed FOA algorithm is utilized to address the issues.
K. Loheswaran
doaj   +1 more source

Fifty years of scheduling: a survey of milestones [PDF]

, 2009
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A., Strusevich, V.A., Potts, Christopher N., Potts, C.N., C N Potts, V A Strusevich   +5 more
core   +1 more source

Approximation Algorithms for Scheduling with Reservations

Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian, Jansen, Klaus, Pascual, Fanny, Trystram, Denis   +3 more
openaire   +4 more sources

Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks [PDF]

Leibniz Transactions on Embedded Systems
Elastic 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, Gill, Christopher, Baruah, Sanjoy   +2 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