✦ LIBER ✦

A 53-approximation algorithm for scheduling vehicles on a path with release and handling times

✍ Scribed by Daya Ram Gaur; Arvind Gupta; Ramesh Krishnamurti

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 78 KB
Volume: 86
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00474-x

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

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times and delivery times

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 679 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Single-vehicle scheduling problems with

Single-vehicle scheduling problems with release and service times on a line

✍ Wei Yu; Zhaohui Liu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB