Results 241 to 250 of about 273,738 (287)

An aggressive parallel tasks scheduling algorithm: relative mobility scheduling algorithm

1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997, 2002
An aggressive scheduling algorithm called Relative Mobility Scheduling algorithm (RMS) which is designed based on heuristic of Relative Mobility (RM) is developed. The proposed aggressive RMS algorithm has the advantage of scheduling tasks into either bounded or unbounded number of processors within a minimize parallel time.
null Wai-Yip Chan, null Chi-Kwong Li
openaire   +1 more source

Algorithms for Scheduling Imprecise Computations

Computer, 1991
Consideration is given to the problem of scheduling tasks each of which is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be executed to completion. If the available processor time is insufficient, the optional subtask can be left incomplete. The error in the result of a task is equal to the processing
J.W.S. Liu, K.-J. Lin, W.-K. Shih, A.C.-s. Yu, J.-Y. Chung, W. Zhao   +5 more
openaire   +1 more source

Sensitivity analysis of scheduling algorithms

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penz, Bernard, Rapine, Christophe, Trystram, Denis   +2 more
openaire   +3 more sources

A Generalized Machine-Scheduling Algorithm

Operational Research Quarterly (1970-1977), 1970
It is proposed to treat a general machine-job-scheduling problem using a branch-and-bound method. Here the general problem is that in which the routing of any job through the machines is specified in advance but is independent of the routing of any other job. In addition there is no requirement for the job to visit all machines.
John M. Charlton, Carl C. Death
openaire   +2 more sources

PRODUCTION SCHEDULING USING GENETIC ALGORITHMS

IFAC Proceedings Volumes, 1992
Abstract Genetic algorithms (GAs) have proved to be robust and reasonably fast in finding good solutions, but are still regarded as an academic toy. The work presented here prepares for a broad application of GAs in industrial settings by providing a user-oriented modelling environment.
J.W. Schulte, B.-D. Becker
openaire   +1 more source

Task-Scheduling Algorithm

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

Stability and distributed scheduling algorithms

Proceedings of the 1985 ACM thirteenth annual conference on Computer Science - CSC '85, 1985
Many 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

Scheduling Algorithms

Journal of the Operational Research Society, 1996
Stuart Johns, Peter Brucker
openaire   +2 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

Performance Guarantees for Scheduling Algorithms

Operations Research, 1978
One 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., Graham, R. L., Johnson, D. S.   +2 more
openaire   +2 more sources