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

On A Scheduling Problem of Time Deteriorating Jobs

โœ Scribed by Jin-Yi Cai; Pu Cai; Yixin Zhu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
313 KB
Volume
14
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
โœ Y.M. Shafransky; V.A. Strusevich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

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-

Randomized On-line Scheduling of Paralle
Randomized On-line Scheduling of Parallel Jobs
โœ Jiล™ฤฑ́ Sgall ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.