𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation schemes for two-agent scheduling on parallel machines

✍ Scribed by Zhao, Kejun; Lu, Xiwen

Book ID
119375427
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
256 KB
Volume
468
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation schemes for scheduling on
Approximation schemes for scheduling on parallel machines
✍ Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid πŸ“‚ Article πŸ“… 1998 πŸ› Springer US 🌐 English βš– 124 KB πŸ‘ 1 views

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which

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