African Journal of
Business Management

  • Abbreviation: Afr. J. Bus. Manage.
  • Language: English
  • ISSN: 1993-8233
  • DOI: 10.5897/AJBM
  • Start Year: 2007
  • Published Articles: 4188

Full Length Research Paper

Proposing a clonal selection algorithm for hybrid flow shop

Mohammad Akhshabi1*, Mostafa Akhshabi2 and Javad Khalatbari3    
1Department of Industrial Engineering, Tonekabon Branch, Islamic Azad University, Tonekabon, Iran. 2Department of Computer Engineering, Tonekabon Branch, Islamic Azad University, Tonekabon, Iran. 3Department of Management, Tonekabon Branch, Islamic Azad University, Tonekabon, Iran.    
Email: [email protected]

  •  Accepted: 09 February 2012
  •  Published: 02 May 2012

Abstract

In this paper we propose a clonal selection algorithm (PCSA) to solve a hybrid flow shop scheduling (HFS) problem considering the minimization of the sum of the total earliness and tardiness penalties. In the view of its non-deterministic polynomial-time hard nature, so we propose the clonal selection algorithm to deal with this problem. The performance of our algorithm is tested by numerical experiments on a large number of randomly generated problems. By comparison with solutions, performance obtained by NEH heuristi (Nawaz et al., 1983) and the HC heuristi (Ho and Chang, 1991) is presented. The results show that the proposed approach performs well for this problem.

 

Key words: Hybrid flow shop, clonal selection algorithm, total earliness and tardiness penalties.

Copyright © 2024 Author(s) retain the copyright of this article.

This article is published under the terms of the Creative Commons Attribution License 4.0

Back to Vol. 6 No. 17
Back to articles
  • Articles on Google by:
SUBSCRIBE TO RSS
SUBMIT MANUSCRIPT
CONFERENCES