Header menu link for other important links
X
Discrete particle swarm optimisation algorithms for minimising the completion-time variance of jobs in flowshops
Published in
2011
Volume: 7
   
Issue: 3
Pages: 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. © 2011 Inderscience Enterprises Ltd.
About the journal
JournalInternational Journal of Industrial and Systems Engineering
ISSN17485037
Open AccessNo
Concepts (10)
  •  related image
    ACO
  •  related image
    ANT COLONY OPTIMISATION
  •  related image
    COMPLETION-TIME VARIANCE
  •  related image
    CTV
  •  related image
    FLOW-SHOP SCHEDULING
  •  related image
    PARTICLE SWARM OPTIMISATION ALGORITHM
  •  related image
    PSOA
  •  related image
    Artificial intelligence
  •  related image
    Particle swarm optimization (pso)
  •  related image
    Algorithms