✦ LIBER ✦

Parametric algorithms for 2-cyclic robot scheduling with interval processing times

✍ Scribed by Vladimir Kats; Eugene Levner

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 577 KB
Volume: 14
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0166-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster polynomial algorithm for 2-cycl

A faster polynomial algorithm for 2-cyclic robotic scheduling

✍ Chengbin Chu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 193 KB

An efficient algorithm for multi-hoist c

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

✍ Janny M.Y. Leung; Eugene Levner 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Approximation algorithms for scheduling

Approximation algorithms for scheduling real-time jobs with multiple feasible intervals

✍ Jian-Jia Chen; Jun Wu; Chi-Sheng Shih 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 579 KB

An approximation algorithm for identical

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

✍ Hans Kellerer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 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

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