A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves

Authors:
Haidar M. Harmanani;Fouad Drouby;Steve Bou Ghosn
Affiliations:
Lebanese American University, Byblos, Lebanon;Lebanese American University, Byblos, Lebanon;Lebanese American University, Byblos, Lebanon
Venue:
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Year:
2009

Citing 9
Cited 0

Punctuated equilibria: a parallel genetic algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A branch & bound algorithm for the open-shop problem

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Parallel programming: techniques and applications using networked workstations and parallel computers

Parallel programming: techniques and applications using networked workstations and parallel computers
A tabu search algorithm for the open shop scheduling problem

Computers and Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems

Proceedings of the 5th International Conference on Genetic Algorithms
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. The method is based on an interesting implementation of genetic operators that combines the use of deterministic and random moves. The method is implemented using MPI on a Beowulf cluster. Favorable results comparisons using the Taillard benchmarks are reported.