𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Scheduling Parallel Jobs

✍ Scribed by Jansen, Klaus; Thöle, Ralf

Book ID
118181067
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
474 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for general par
Approximation algorithms for general parallel task scheduling
✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot

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