𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal On-Line Scheduling of Parallel Jobs with Dependencies

✍ Scribed by Anja Feldmann; Ming-Yang Kao; Jiří Sgall; Shang-Hua Teng

Book ID
110281251
Publisher
Springer US
Year
1998
Tongue
English
Weight
165 KB
Volume
1
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On an on-line scheduling problem for par
On an on-line scheduling problem for parallel jobs
✍ Edwin Naroska; Uwe Schwiegelshohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 101 KB

This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 -1 m

The optimal on-line parallel machine sch
The optimal on-line parallel machine scheduling
✍ Yong He 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 271 KB

This paper investigates on-line parallel machine scheduling problems. We show the optimality of the classical LS algorithm. (~) 2000 Elsevier Science Ltd. All rights reserved.

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