𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Online scheduling of parallel jobs on two machines is 2-competitive

✍ Scribed by J.L. Hurink; J.J. Paulus

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
148 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
✍ Zhi-Long Chen; Warren B. Powell πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

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-

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