Results 171 to 180 of about 62,265 (211)
Some of the next articles are maybe not open access.
GEM: A geometric algorithm for scheduling
1993 IEEE International Symposium on Circuits and Systems, 2002Scheduling in high-level synthesis is essentially assigning operations to different clock cycles or Csteps. A simple algorithm for scheduling in high-level synthesis is presented. The critical path (longest path) approach is used, schedules better than or comparable to the existing algorithms are obtained.
Salil Raje, Majid Sarrafzadeh
openaire +1 more source
Performance Guarantees for Scheduling Algorithms
Operations Research, 1978One approach to coping with the apparent difficulty of many schedule-optimization problems, such as occur in machine shops and computer processing, is to devise efficient algorithms that find schedules guaranteed to be “near-optimal.” This paper presents an introduction to this approach by describing its application to a well-known multiprocessor ...
M. R. Garey +2 more
openaire +2 more sources
Design of Scheduling Algorithms: Applications
2010This 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 +5 more
openaire +3 more sources
Algorithms for Scheduling Independent Tasks
Journal of the ACM, 1976The 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, 1972Suppose 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
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 +3 more
openaire +3 more sources
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 +3 more
openaire +3 more sources
Equilibria of Online Scheduling Algorithms
Proceedings of the AAAI Conference on Artificial Intelligence, 2013We 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 +2 more
openaire +1 more source
Production scheduling and genetic algorithms
1995This 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, 2003We 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
Train Scheduling: Hardness and Algorithms
2020We 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