✦ LIBER ✦

A faster polynomial algorithm for 2-cyclic robotic scheduling

✍ Scribed by Chengbin Chu

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 193 KB
Volume: 9
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-006-8501-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parametric algorithms for 2-cyclic robot

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

✍ Vladimir Kats; Eugene Levner 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 577 KB

A polynomial time algorithm for Zero-Cla

A polynomial time algorithm for Zero-Clairvoyant scheduling

✍ K. Subramani 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 206 KB

A faster polynomial algorithm for the un

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

✍ Ulrich Brenner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm

A faster strongly polynomial time algori

A faster strongly polynomial time algorithm for submodular function minimization

✍ James B. Orlin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

A polynomial algorithm for no-wait cycli

A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

✍ Ada Che; Chengbin Chu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 349 KB

A faster branch-and-bound algorithm for

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

✍ Francis Sourd; Safia Kedad-Sidhoum 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 434 KB