Author： Shokrollahpour E. Zandieh M. Dorri Behrouz
Publisher： Taylor & Francis Ltd
ISSN： 0020-7543
Source： International Journal of Production Research, Vol.49, Iss.11, 2011-06, pp. : 3087-3103
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
This paper deals with the two-stage assembly flowshop scheduling problem with minimisation of weighted sum of makespan and mean completion time as the objective. The problem is NP-hard, hence we proposed a meta-heuristic named imperialist competitive algorithm (ICA) to solve it. Since appropriate design of the parameters has a significant impact on the algorithm efficiency, we calibrate the parameters of this algorithm using the Taguchi method. In comparison with the best algorithm proposed previously, the ICA indicates an improvement. The results have been confirmed statistically.
Related content
By Azadeh A. Jeihoonian M. Shoja B. Maleki Seyedmahmoudi S.H.
International Journal of Production Research, Vol. 50, Iss. 24, 2012-12 ,pp. :
Access to resources
Recommend
Bicriteria scheduling in a two-machine permutation flowshop
By Lin B. M. T.
International Journal of Production Research, Vol. 44, Iss. 12, 2006-06 ,pp. :