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

Authors:
Istvan Borgulya
Affiliations:
University of Pecs, Faculty of Business and Economics, Hungary
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 8
Cited 1

An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Genetic Algorithms on LAN-message Passing Architectures using PVM: Application to the Routing Problem

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time

Computers and Industrial Engineering
Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Approximative procedures for no-wait job shop scheduling

Operations Research Letters

Biological plausibility in optimisation: an ecosystemic view

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

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 steadystate 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.