✦ LIBER ✦

Assignment of independent tasks to minimize completion time

✍ Scribed by Ben A. Blake

Book ID: 112210646
Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 721 KB
Volume: 22
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380220903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning of independent tasks for mi

Partitioning of independent tasks for minimizing completion time and total waiting time

✍ Zhang Zhongyun; Zhu Mingfa; Li Jie 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 299 KB

Batch scheduling to minimize total compl

Batch scheduling to minimize total completion time

✍ Jay B. Ghosh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 305 KB

Scheduling independent 2-processor tasks

Scheduling independent 2-processor tasks to minimize schedule length

✍ J. BŁaZ̀ewicz; J. Weglarz; M. Drabowski 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Customer order scheduling to minimize to

Customer order scheduling to minimize total weighted completion time

✍ Guoqing Wang; T.C. Edwin Cheng 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 126 KB

On-line scheduling to minimize average c

On-line scheduling to minimize average completion time revisited

✍ Nicole Megow; Andreas S Schulz 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios

Combinatorial Algorithms for Data Migrat

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

✍ Rajiv Gandhi; Julián Mestre 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 371 KB