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

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

โœ Scribed by Natalia V. Shakhlevich; Vitaly A. Strusevich

Publisher
Springer
Year
2007
Tongue
English
Weight
541 KB
Volume
51
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling identical jobs on uniform par
Scheduling identical jobs on uniform parallel machines with random processing times
โœ Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.

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-

Scheduling jobs on parallel machines wit
Scheduling jobs on parallel machines with sequence-dependent setup times
โœ Young Hoon Lee; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the