Results 271 to 280 of about 89,645 (310)

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   +1 more source

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   +3 more sources

Equilibria of Online Scheduling Algorithms

Proceedings of the AAAI Conference on Artificial Intelligence, 2013
We describe a model for competitive online scheduling algorithms. Two servers, each with a single observable queue, compete for customers. Upon arrival, each customer strategically chooses the queue with minimal expected wait time. Each scheduler wishes to maximize its number of customers, and can strategically select which scheduling ...
Itai Ashlagi, Brendan Lucier, Moshe Tennenholtz   +2 more
openaire   +1 more source

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   +1 more source

Algorithms for packing and scheduling problems

Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2003
We survey the main results presented in the author’s Ph.D Thesis (Monaci 2001), discussed on January 2002 at the University of Bologna (Italy) and supervised by Paolo Toth and Silvano Martello. The thesis deals with exact and heuristic approaches for solving a class of combinatorial optimization problems, with particular emphasis on Two-Dimensional ...
openaire   +1 more source

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

Expert Systems With Applications, 2022
Matthew Squires, Xiaohui Tao, Raj Gururajan   +2 more
exaly  

Train Scheduling: Hardness and Algorithms

2020
We introduce the Train Scheduling Problem which can be described as follows: Given m trains via their tracks, i.e., curves in the plane, and the trains’ lengths, we want to compute a schedule that moves collision-free and with limited speed the trains along their tracks such that the maximal travel time is minimized. We prove that there is no FPTAS for
openaire   +1 more source

A drum scheduling algorithm

2006
C. K. Wong, C. L. Liu 0001, J. Apter
openaire   +1 more source

A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling

IEEE Transactions on Cybernetics, 2022
Zixiao Pan, Deming Lei, Ling Wang
exaly  

Scheduling Algorithms

Journal of the Operational Research Society, 1996
Stuart Johns, Peter Brucker
openaire   +2 more sources