✦ LIBER ✦

A parallel sequencing algorithm for minimizing total cost

✍ Scribed by M. K. Rajaraman

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 434 KB
Volume: 24
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800240311

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Seismic zoning for initial- and total-co

Seismic zoning for initial- and total-cost minimization

✍ Garc�a-P�rez, Jaime 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

We consider two design criteria to study seismic zoning. In the "rst, codes require that structures be designed for some speci"ed values. Zoning is then optimal when it minimizes the expected present value of the initial costs of all structures to be built in the region being zoned. In the second cr

Approximation algorithms for minimizing

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re

Two-phase Heuristic Algorithm for Delay

Two-phase Heuristic Algorithm for Delay Constrained Minimal Cost Loop Problem

✍ Yong-Jin Lee; Tai-Yun Kim 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 589 KB

This article presents a heuristic algorithm that consists of two phases for the DMCLP under the constraints that the number of nodes served by a single loop is limited and networks mean delay is within the desired time.

A Parallel Algorithm for Partitioning a

A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters

✍ Muhammad H. Alsuwaiyel 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Polynomial algorithms for partitioning a

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs

✍ N. Apollonio; I. Lari; F. Ricca; B. Simeone; J. Puerto 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

A Parallel Algorithm for 4×4 DCT

✍ J. Jiang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 175 KB

By developing a generalized 1D approach and parallel computing algorithm, this paper presents a parallel algorithm design and hardware implementation for the computation of 4\_4 DCT. This algorithm sorts all the 2D input pixel data into four groups. Each group is then forwarded to a 1D DCT arithmeti