๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal preemptive scheduling on a fixed number of identical parallel machines

โœ Scribed by Aziz Moukrim; Alain Quilliot

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
203 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling a maintenance activity on par
Scheduling a maintenance activity on parallel identical machines
โœ Asaf Levin; Gur Mosheiov; Assaf Sarig ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 113 KB

## Abstract We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
โœ Zhen-Ping Lo; B. Bavarian ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap

Online real-time preemptive scheduling o
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
โœ Bhaskar Das Gupta; Michael A. Palis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-