𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

✍ Scribed by Stavros G. Kolliopoulos; George Steiner

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

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

2-Approximation algorithms for the multi
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
✍ Yoshiyuki Karuno; Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h