✦ LIBER ✦

A hybrid algorithm for independent task parallel machine scheduling

✍ Scribed by Dar-El, EM; Karni, R

Book ID: 121926170
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 244 KB
Volume: 8
Category: Article
ISSN: 0305-0483
DOI: 10.1016/0305-0483(80)90029-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel genetic simulated annealing h

A parallel genetic simulated annealing hybrid algorithm for task scheduling

✍ Shu Wanneng; Zheng Shijue 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 481 KB

Algorithms for Scheduling Independent Ta

Algorithms for Scheduling Independent Tasks

✍ Sahni, Sartaj K. 📂 Article 📅 1976 🏛 Association for Computing Machinery 🌐 English ⚖ 891 KB

Randomized truthful algorithms for sched

Randomized truthful algorithms for scheduling selfish tasks on parallel machines

✍ Eric Angel; Evripidis Bampis; Nicolas Thibault 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Ordinal algorithms for parallel machine

Ordinal algorithms for parallel machine scheduling

✍ Wei-Ping Liu; Jeffrey B. Sidney; André van Vliet 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Parallel machine scheduling with splitti

Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm

✍ Wang, Wan-Liang; Wang, Hai-Yan; Zhao, Yan-Wei; Zhang, Li-Ping; Xu, Xin-Li 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Approximation algorithms for general par

Approximation algorithms for general parallel task scheduling

✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot