𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

✍ Scribed by Andreas Krämer

Publisher
Springer
Year
1997
Tongue
German
Weight
930 KB
Volume
19
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A comparison of heuristics for schedulin
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
✍ A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 266 KB

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know

Optimal Compile-Time Multiprocessor Sche
Optimal Compile-Time Multiprocessor Scheduling Based on the O–1 Linear Programming Algorithm with the Branch and Bound Technique
✍ D.Antony Louis Piriyakumar; C.Siva Ram Murthy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 238 KB

This paper is organized as follows. We describe the formulation of the problem and the required definitions in Section II. In Section III, the performance improvement over [6] due to processor isomorphism and look ahead pruning in reducing the search space is explained, along with a note on the lowe

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi