✦ LIBER ✦

On the online track assignment problem

✍ Scribed by Marc Demange; Gabriele Di Stefano; Benjamin Leroy-Beaulieu

Book ID: 113564770
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 365 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Thek-Track Assignment Problem on Partial

Thek-Track Assignment Problem on Partial Orders

✍ Paulo Barcia; J. Orestes Cerdeira 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 222 KB

A Greedy On-Line Algorithm for thek-Trac

A Greedy On-Line Algorithm for thek-Track Assignment Problem

✍ U Faigle; W Kern; W.M Nawijn 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than Ž . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

On the track-to-track correlation proble

On the track-to-track correlation problem

✍ Bar-Shalom, Y. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 180 KB

On track with Online Education

✍ Katte Brown 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 94 KB

On the quadratic assignment problem

✍ A.M. Frieze; J. Yadegar 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 537 KB

On the bottleneck assignment problem

✍ A. Ravindran; V. Ramaswami 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 391 KB