✦ LIBER ✦

A note on parallel machine replacement

✍ Scribed by Jen Tang; Kwei Tang

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 245 KB
Volume: 40
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199306)40:4<569::aid-nav3220400410>3.0.co;2-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A further note on parallel machine repla

A further note on parallel machine replacement

✍ Wallace J. Hopp; Philip C. Jones; James L. Zydiak 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

Approximation schemes for scheduling on

Approximation schemes for scheduling on parallel machines

✍ Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 124 KB

We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which

Scheduling jobs and maintenance activiti

Scheduling jobs and maintenance activities on parallel machines

✍ Chung-Yee Lee; Zhi-Long Chen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machin

Note: On the two-machine no-idle flowsho

Note: On the two-machine no-idle flowshop problem

✍ Ondřej Čepek; Masanori Okada; Milan Vlach 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these cla

Parallel MP2-energy evaluation: Simulate

Parallel MP2-energy evaluation: Simulated shared memory approach on distributed memory parallel machines

✍ Limaye, Ajay C. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

A parallel algorithm for four-index transformation and MP2 energy evaluation, Ž . for distributed memory parallel MIMD machines is presented. The underlying serial algorithm for the present parallel effort is the four-index transform. The scheme works through parallelization over AO integrals and, t

Efficient support for fine-grain paralle

Efficient support for fine-grain parallelism on shared-memory machines

✍ LOWENTHAL, DAVID K.; FREEH, VINCENT W.; ANDREWS, GREGORY R. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

A coarse-grain parallel program typically has one thread (task) per processor, whereas a finegrain program has one thread for each independent unit of work. Although there are several advantages to fine-grain parallelism, conventional wisdom is that coarse-grain parallelism is more efficient. This p