𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

✍ Scribed by Leah Epstein hanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. [email protected].; Jiri Sgall

Publisher
Springer
Year
2004
Tongue
English
Weight
165 KB
Volume
39
Category
Article
ISSN
0178-4617

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

Scheduling a maintenance activity on par
Scheduling a maintenance activity on parallel identical machines
✍ Asaf Levin; Gur Mosheiov; Assaf Sarig πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 113 KB

## Abstract We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required

An Efficient Approximation Algorithm for
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
✍ Chandra Chekuri; Michael Bender πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 107 KB

We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time