Header menu link for other important links
X
A modified ant-colony optimisation algorithm to minimise the completion time variance of jobs in flowshops
Published in
2012
Volume: 50
   
Issue: 20
Pages: 5698 - 5706
Abstract
In this work, the flowshop scheduling problem is considered with the objective of minimising the completion-time variance (CTV) of jobs, and an Ant Colony Optimisation (ACO) algorithm is presented. Two implementations of the Modified Ant Colony Optimisation algorithm (MACO-I and MACO-II) are proposed to solve the permutation flowshop scheduling problem. The proposed ant-colony-algorithm implementations have been tested on 90 benchmark flowshop scheduling problems. The solutions yielded by the proposed MACO implementations are compared with various algorithms and with the best CTV of jobs reported in the literature. The proposed MACO implementations are found to perform very well in minimising the chosen performance measure. © 2012 Copyright Taylor and Francis Group, LLC.
About the journal
JournalInternational Journal of Production Research
ISSN00207543
Open AccessNo
Concepts (10)
  •  related image
    ANT COLONY OPTIMISATION
  •  related image
    ANT-COLONY ALGORITHM
  •  related image
    COMPLETION-TIME VARIANCE
  •  related image
    FLOW SHOP SCHEDULING PROBLEM
  •  related image
    FLOW-SHOPS
  •  related image
    Optimisations
  •  related image
    Performance measure
  •  related image
    PERMUTATION FLOWSHOP SCHEDULING PROBLEMS
  •  related image
    Scheduling
  •  related image
    Algorithms