Results 161 to 170 of about 62,265 (211)

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

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

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

New Algorithms for Disk Scheduling

Algorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Andrews, Michael A. Bender, Lisa Zhang 0001   +2 more
openaire   +1 more source

Robust Algorithms for Preemptive Scheduling

Algorithmica, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Asaf Levin
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
Jane W.-S. Liu, Kwei-Jay Lin, Wei-Kuan Shih, Albert Chuang-shi Yu, Jen-Yao Chung, Wei Zhao 0001   +5 more
openaire   +1 more source

Algorithm Selection and Scheduling

2011
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifying the most appropriate solver given an input instance, they are bound to make wrong and, at times, costly decisions.
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann   +4 more
openaire   +1 more source

On the Optimality of Feautrier’s Scheduling Algorithm

Concurrency and Computation: Practice and Experience, 2002
AbstractFeautrier's scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction, but it has always been known to be suboptimal. However, the question as to whether it may miss some parallelism because of its design has not been answered. We show that this is not the case.
openaire   +3 more sources

A Level Algorithm for Preemptive Scheduling

Journal of the ACM, 1977
Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available. Their algorithm is adapted here to handle processors of different speeds.
Edward C. Horvath, Shui Lam, Ravi Sethi
openaire   +2 more sources

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