文章基本信息

标题：Proposing a clonal selection algorithm for hybrid flow shop
本地全文：下载
作者：Mohammad Akhshabi ; Mostafa Akhshabi ; Javad Khalatbari 等
期刊名称：African Journal of Business Management
印刷版ISSN：1993-8233
出版年度：2012
卷号：6
期号：17
页码：5744-5749
DOI：10.5897/AJBM11.2232
语种：English
出版社：Academic Journals
摘要：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.
关键词：Hybrid flow shop; clonal selection algorithm; total earliness and tardiness penalties