Discrete particle swarm optimisation algorithms for minimising the completion-time variance of jobs in flowshops

K. Rameshkumar, Chandrasekharan Rajendran and K.M. Mohanasundaram

International Journal of Industrial and Systems Engineering, 2011, vol. 7, issue 3, 317-340

Abstract: In this paper, the problem of scheduling in the permutation flowshop scheduling problem is considered with the objective of minimising the completion-time variance of jobs (CTV). Two particle swarm optimisation algorithms (PSOAs) are proposed and analysed. The first PSOA is inspired from the solution construction procedures that are used in ant colony optimisation algorithms. The second algorithm is a newly developed one. The proposed algorithms are applied to a set of benchmark flowshop scheduling problems, and performances of the algorithms are evaluated by comparing the obtained results with the results published in the literature. The performance analysis demonstrates the effectiveness of the proposed algorithms in solving the permutation flowshop sequencing problem with the CTV objective.

Keywords: flowshop scheduling; flowshops; completion-time variance; particle swarm optimisation; algorithms; ACO; ant colony optimisation; job completion; solution construction; benchmarks; industrial engineering; systems engineering. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=38982 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:7:y:2011:i:3:p:317-340

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().