𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating multi-objective scheduling problems

✍ Scribed by Dabia, Said; Talbi, El-Ghazali; van Woensel, Tom; De Kok, Ton

Book ID
118747154
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
512 KB
Volume
40
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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