𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A network parallel genetic algorithm for the one machine sequencing problem

✍ Scribed by M.K. Mayer

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
626 KB
Volume
37
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a network parallel genetic algorithm for the one machine sequencing problem. It examines a parallel genetic algorithm in which processors exchange their best solution found at periodic intervals and the case when no exchange is performed. The network parallel genetic algorithm is executed on a cluster of IBM RS/6000 workstations using a master-slave approach. Performance to a serial genetic algorithm is reported. (~

πŸ“œ SIMILAR VOLUMES

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
✍ V. Srinivasan πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A Data Parallel Algorithm for Solving th
A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine
✍ N. Copty; S. Ranka; G. Fox; R.V. Shankar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare