Results 21 to 30 of about 62,265 (211)

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

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

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

Instability of MaxWeight Scheduling Algorithms [PDF]

IEEE INFOCOM 2009, 2009
MaxWeight scheduling algorithms provide an effective mechanism for achieving queue stability and guaranteeing maximum throughput in a wide variety of scenarios. The maximum-stability guarantees however rely on the fundamental premise that the system consists of a fixed set of sessions with stationary ergodic traffic processes.
Peter M. van de Ven, Sem C. Borst, Seva Shneer   +2 more
openaire   +2 more sources

The power of reordering for online minimum makespan scheduling [PDF]

, 2014
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines.
Englert, Matthias, Özmen, Deniz, Westermann, Matthias, Oezmen, Deniz   +3 more
core   +1 more source

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 constraint satisfaction adaptive neural network for job-shop scheduling [PDF]

, 2010
Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S, Kendall, Graham, Wang, Dingwei, Chai, T, Shengxiang Yang, Chai, Tianyou, Graham Kendall, Dingwei Wang, Yang, Shengxiang, Wang, D, Kendall, G, Tianyou Chai   +11 more
core   +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 , Narimantas Listopadskis   +1 more
doaj   +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   +3 more sources

An improved adaptive neural network for job-shop scheduling [PDF]

, 2005
This article is posted here with permission of IEEE - Copyright @ 2005 IEEEJob-shop scheduling is one of the most difficult production scheduling problems in industry.
Yang, S, Shengxiang Yang, Yang, Shengxiang   +2 more
core   +1 more source