𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity and approximation for scheduling problem for a torpedo

✍ Scribed by G. Simonin; R. Giroudeau; J.C. König

Book ID
113536610
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
373 KB
Volume
61
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and approximation results for
Complexity and approximation results for scheduling multiprocessor tasks on a ring
✍ Giuseppe Confessore; Paolo Dell'Olmo; Stefano Giordani 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 398 KB

We study a multiprocessor task scheduling problem, in which each task requires a set of processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require the

A parallel approximation scheme for the
A parallel approximation scheme for the multiprocessor scheduling problem
✍ Ricardo C. Corrêa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 433 KB

In this paper, a parallel branch-and-bound approach for ®nding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ®nd solutions to the subproblems enumerated during the

An approximation result for a duo-proces
An approximation result for a duo-processor task scheduling problem
✍ P. Dell'Olmo; S. Giordani; M.G. Speranza 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 479 KB

We consider the problem of scheduling tasks on a set of dedicated processors, where each task requires a subset of two processors be simultaneously available for a given processing time. The objective is to determine a nonpreemptive schedule with minimum completion time. By means of a graph theoreti