๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple linear time approximation algorithm for multi-processor job scheduling on four processors

โœ Scribed by Jingui Huang; Jianer Chen; Songqiao Chen; Jianxin Wang

Publisher
Springer US
Year
2006
Tongue
English
Weight
602 KB
Volume
13
Category
Article
ISSN
1382-6905

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