An island model for the no-wait flow shop scheduling problem

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present an evolutionary algorithm (EA) for the no-wait flow shop scheduling problem. This is a new island model with special master-slave structure. In all islands runs a hybrid steady-state algorithm that uses truncation selection, uses only mutation for the generation of the descendants and it improves the solutions with two local search procedures. The mutation is based on the new, modified version of "the EVL method", that is a memory based method. The algorithm was tested on benchmark problems; its results are similar to or better than the results of the particle swarm optimization algorithms. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Borgulya, I. (2010). An island model for the no-wait flow shop scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 280–289). https://doi.org/10.1007/978-3-642-15871-1_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free