𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

✍ Scribed by Carlo Filippi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
382 KB
Volume
38
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori

A min-sum 3/2-approximation algorithm fo
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
✍ FabiΓ‘n A. Chudak πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 70 KB πŸ‘ 1 views

We consider the problem of minimizing the sum of weighted completion times of jobs scheduled on unrelated parallel machines. That is, there are n jobs and m machines; job j takes p GH units of time if processed on machine i and has a weight w H . If C H is the completion time of job j, the objective

Scheduling problems for parallel dedicat
Scheduling problems for parallel dedicated machines under multiple resource constraints
✍ H. Kellerer; V.A. Strusevich πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 249 KB

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiΓΏcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ΓΏxed number of machines in which a job uses at mo