A network parallel genetic algorithm for the one machine sequencing problem

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.