Results 231 to 240 of about 324,021 (282)

A Heuristic Scheduling Algorithm

Journal of the Operational Research Society, 1980
This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame of the schedule and the difference between the exogenously given number of people desired at each available location-activity-period position and those ...
Hosios, A. J., Rousseau, J. M.
openaire   +1 more source

Iterative Scheduling Algorithms

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007
The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switch is the scheduling algorithm that decides which packets to transfer from ingress ports to egress ports in a given timeslot. It is desirable that such algorithms be iterative (so
M. Bayati, B. Prabhakar, D. Shah, M. Sharma   +3 more
openaire   +1 more source

Design of Scheduling Algorithms

2010
The accomplishment of a manufacturing company's objectives is strongly connected to the efficient solution of scheduling problems that are faced in the production environment. Numerous methods for the solution of these problems have been published. However, very few of them have been adopted by manufacturing companies.
Jan, Riezebos, Hoc, Jean-Michel, Nasser, Mebarki, Christos, Dimopoulos, Wout Van, Wezel, Guillaume, Pinot   +5 more
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

New Algorithms for Disk Scheduling

Algorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrews, M., Bender, M. A., Zhang, L.
openaire   +1 more source

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