𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximations and auctions for scheduling batches on related machines

✍ Scribed by Tamás Kis; Richárd Kápolnai

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
207 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximate tradeoff for bicriter
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
✍ Eric Angel; Evripidis Bampis; Alexander Kononov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 305 KB

We consider multiobjective scheduling problems, i.e. scheduling problems that are evaluated with respect to many cost criteria, and we are interested in determining a trade-o (Pareto curve) among these criteria. We study two types of bicriteria scheduling problems: single-machine batching problems a

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