✦ LIBER ✦

An absolute approximation algorithm for scheduling unrelated machines

✍ Scribed by Evgeny Shchepin; Nodari Vakhania

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 102 KB
Volume: 53
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20157

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

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 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

Approximation Algorithms for Precedence-

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

✍ Fabián A Chudak; David B Shmoys 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Approximation algorithms for shop schedu

Approximation algorithms for shop scheduling problems with minsum objective

✍ Maurice Queyranne; Maxim Sviridenko 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We