𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle

✍ Scribed by Xiaoguang Bao; Zhaohui Liu

Book ID
113927698
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
239 KB
Volume
434
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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