A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty. (4th September 2014)

• Record Type: Journal Article
• Authors: JIAO, BIN; YAN, SHAOBIN
• Is Part Of: Mathematical structures in computer science. Volume 24:Number 5(2014)
• Publication Date: 2014-09-04
• Subjects: Computer science -- Mathematics -- Periodicals; 004.015105
• DOI: 10.1017/S0960129512000461
• Languages: English
• ISSNs: 0960-1295

Abstract

<abstract abstract-type="normal"> <title> <x content-type="archive" xml:space="preserve">Abstract</x> </title> <p>The flow shop scheduling problem based on ideal and precise conditions has been a focus of considerable research since the first easy scheduling problem was formulated. In reality, some uncertain factors always restrict the scheduling optimisation problem. In this paper, taking uncertain processing time as an example, we use generalised rough sets theory to transform the rough flow shop scheduling model into the precise scheduling model. We adopt a cooperative co-evolutionary particle swarm optimisation algorithm based on a niche sharing scheme (NCPSO) to minimise the makespan in comparison with the particle swarm optimiser (PSO) and co-evolution particle swarm optimiser (CPSO) algorithms. The new algorithm is characterised by a strengthening of the ability to reserve excellent particles and searching the optimal solution. Experimental results show that the new algorithm is more effective and efficient than the others.</p> </abstract>