𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Performance evaluation of a parallel tabu search task scheduling algorithm

✍ Scribed by Stella C.S. Porto; João Paulo F.W. Kitajima; Celso C. Ribeiro

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
675 KB
Volume
26
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Scheduling of Arbitrary Task G
Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm
✍ Yu-Kwong Kwok; Ishfaq Ahmad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio

The impact of approximate evaluation on
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
✍ Watson, J. P. (author);Rana, S. (author);Whitley, L. D. (author);Howe, A. E. (au 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 254 KB 👁 2 views

The Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory, Search-based solutions require fast objective functions. Thus, a