Results 221 to 230 of about 38,671 (260)

A Level Algorithm for Preemptive Scheduling

Journal of the ACM, 1977
Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available. Their algorithm is adapted here to handle processors of different speeds.
Edward C. Horvath, Shui Lam, Ravi Sethi
openaire   +3 more sources

Design of Scheduling Algorithms: Applications

2010
This chapter discusses the insights developed for designing scheduling algorithms according to three design projects where algorithms have been developed. The choice of applications covers a broad spectrum. The methods used are from three different fields, namely combinatorial optimization, genetic (evolutionary) algorithms, and mathematical ...
Jan, Riezebos, Hoc, Jean-Michel, Nasser, Mebarki, Dimopoulos, Christos, Wout Van, Wezel, Pinot, Guillaume   +5 more
openaire   +3 more sources

Algorithms for Scheduling Independent Tasks

Journal of the ACM, 1976
The following job sequencing problems are studied: (i) single processor job sequencing with deadlines, (ii) job sequencing on m -identical processors to minimize finish time and related problems, (iii) job sequencing on 2-identical processors to minimize weighted mean flow time.
openaire   +1 more source

An Optimal Drum Scheduling Algorithm

IEEE Transactions on Computers, 1972
Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an algorithm that schedules the processing of these records with the minimal total amount of rotational ...
openaire   +2 more sources

Broadcast scheduling

ACM Transactions on Algorithms, 2011
Broadcast Scheduling is a popular method for disseminating information in response to client requests. There are n pages of information, and clients request pages at different times. However, multiple clients can have their requests satisfied by a single broadcast of the requested page.
Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller   +3 more
openaire   +4 more sources

Production scheduling and genetic algorithms

1995
This treatise deals with the applicability of genetic algorithms to the area of production scheduling. To begin with, an introduction to the principles of genetic algorithms is given. After having outlined a standard genetic algorithm, first approaches to the traveling salesman problem are explained.
openaire   +2 more sources

A Taxonomy of Workflow Scheduling Algorithms

2017
A workflow is a set of steps or tasks that model the execution of a process, e.g., protein annotation, invoice generation and composition of astronomical images. Workflow applications commonly require large computational resources. Hence, distributed computing approaches (such as Grid and Cloud computing) emerge as a feasible solution to execute them ...
Fernando Aguilar-Reyes, J. Octavio Gutiérrez-García   +1 more
openaire   +1 more source

Core Algorithms of the Maui Scheduler

2001
The Maui scheduler has received wide acceptance in the HPC community as a highly configurable and effective batch scheduler. It is currently in use on hundreds of SP, O2K, and Linux cluster systems throughout the world including a high percentage of the largest and most cutting edge research sites.
David B. Jackson, Quinn Snell, Mark J. Clement   +2 more
openaire   +1 more source

A novel genetic algorithm based system for the scheduling of medical treatments

Expert Systems With Applications, 2022
Xiaohui Tao, Xujuan Zhou, Raj Gururajan
exaly  

Examining the developments in scheduling algorithms research: A bibliometric approach

Heliyon, 2022
Temidayo Oluwatosin Omotehinwa
exaly