✦ LIBER ✦

Shop scheduling problems with multiprocessor tasks on dedicated processors

✍ Scribed by Peter Brucker; Andreas Krämer

Book ID: 112693297
Publisher: Springer US
Year: 1995
Tongue: English
Weight: 1009 KB
Volume: 57
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02099688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling preemptive multiprocessor tas

Scheduling preemptive multiprocessor tasks on dedicated processors

✍ L. Bianco; J. Błażewicz; P. Dell'Olmo; M. Drozdowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Scheduling multiprocessor tasks on three

Scheduling multiprocessor tasks on three dedicated processors

✍ J. Błżewicz; P. Dell'Olmo; M. Drozdowski; M.G. Speranza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Branch and bound methods for scheduling

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

✍ Andreas Krämer 📂 Article 📅 1997 🏛 Springer 🌐 German ⚖ 930 KB

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

A note on scheduling multiprocessor task

A note on scheduling multiprocessor tasks with precedence constraints on parallel processors

✍ A.K. Amoura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Preemptive scheduling of multiprocessor

Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness

✍ L. Bianco; J. Błażewicz; P. Dell'Olmo; M. Drozdowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 376 KB