✦ LIBER ✦

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

✍ Scribed by Rajiv Gandhi; Julián Mestre

Publisher: Springer
Year: 2007
Tongue: English
Weight: 371 KB
Volume: 54
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9118-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully combinatorial 2-approximation al

A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time

✍ N.N. Pisaruk 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The ÿrst combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact

An optimal online algorithm for single m

An optimal online algorithm for single machine scheduling to minimize total general completion time

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Jiazhen Huo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 335 KB

An algorithm for single machine sequenci

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 721 KB