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

Online Scheduling to Minimize Average Stretch

โœ Scribed by Muthukrishnan, S.; Rajaraman, Rajmohan; Shaheen, Anthony; Gehrke, Johannes E.

Book ID
118181126
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
221 KB
Volume
34
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On-line scheduling to minimize average c
On-line scheduling to minimize average completion time revisited
โœ Nicole Megow; Andreas S Schulz ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios

Scheduling deteriorating jobs to minimiz
Scheduling deteriorating jobs to minimize makespan
โœ Wieslaw Kubiak; Steef van de Velde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i