Results 241 to 250 of about 324,021 (282)
Some of the next articles are maybe not open access.
2001
This chapter presents a task-scheduling algorithm for a heterogeneous computing environment with a bounded number of processors. We first present the Heterogeneous Earliest Finish Time (HEFT) Algorithm [53] proposed by Haluk Rahmi Topcuoglu, and we then present the Dynamic Heterogeneous Prediction-Based (DHPB) Schedeuling Algorithm, and analyze its ...
Dongmin Kim, Salim Hariri
openaire +1 more source
This chapter presents a task-scheduling algorithm for a heterogeneous computing environment with a bounded number of processors. We first present the Heterogeneous Earliest Finish Time (HEFT) Algorithm [53] proposed by Haluk Rahmi Topcuoglu, and we then present the Dynamic Heterogeneous Prediction-Based (DHPB) Schedeuling Algorithm, and analyze its ...
Dongmin Kim, Salim Hariri
openaire +1 more source
Stability and distributed scheduling algorithms
Proceedings of the 1985 ACM thirteenth annual conference on Computer Science - CSC '85, 1985Many distributed scheduling algorithms have been developed and reported in the current literature. However, very few of them explicitly treat stability issues. This paper first discusses stability issues for distributed scheduling algorithms in general terms.
openaire +1 more source
Journal of the Operational Research Society, 1996
Stuart Johns, Peter Brucker
openaire +2 more sources
Stuart Johns, Peter Brucker
openaire +2 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
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 ...
Garey, M. R. +2 more
openaire +2 more sources
Approximation Algorithms for Scheduling Problems
2009complexity and ...
Giroudeau, Rodolphe, König, Jean-Claude
openaire +2 more sources
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
A Manual Production Scheduling Algorithm
Journal of the Operational Research Society, 1974This paper describes a manual algorithm for determining optimal production schedules when there are linear costs associated with production and storage, demand is deterministic and there is no backlogging. The method is described for use in the one-product, one-line situation and extended for use in the multiproduct, one-line situation. Examples of the
openaire +2 more sources
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