CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Hybrid Flow Shop Scheduling using Improved Hybrid ACO Cuckoo Algorithm to Minimize Makespan

by Ravianandan M, M.omkumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 115 - Number 18
Year of Publication: 2015
Authors: Ravianandan M, M.omkumar
10.5120/20251-2619

Ravianandan M, M.omkumar . Hybrid Flow Shop Scheduling using Improved Hybrid ACO Cuckoo Algorithm to Minimize Makespan. International Journal of Computer Applications. 115, 18 ( April 2015), 16-20. DOI=10.5120/20251-2619

@article{ 10.5120/20251-2619,
author = { Ravianandan M, M.omkumar },
title = { Hybrid Flow Shop Scheduling using Improved Hybrid ACO Cuckoo Algorithm to Minimize Makespan },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 115 },
number = { 18 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 16-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume115/number18/20251-2619/ },
doi = { 10.5120/20251-2619 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:55:13.270085+05:30
%A Ravianandan M
%A M.omkumar
%T Hybrid Flow Shop Scheduling using Improved Hybrid ACO Cuckoo Algorithm to Minimize Makespan
%J International Journal of Computer Applications
%@ 0975-8887
%V 115
%N 18
%P 16-20
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Scheduling of jobs in manufacturing environment is often NP Hard4. Multi stage Hybrid flow shop with a number of unequal parallel machines choices per stage makes it a further NP Hard to solve. Improved Hybrid ACO Cuckoo Algorithm proposed in this paper attempts to apply the algorithm to solve one such Hybrid flow shop problem. The performance of the algorithm was benchmarked against available Hybrid Algorithms to solve Hybrid flow shop. The outcome of the algorithm outperforms the performance of some of the Hybrid algorithm currently available.

References
  1. Omkumar, M, Shahabudeen, P, Gughan, S & Azad, 2009, 'GA based static scheduling of multilevel assembly job shops', International journal for Operational Research.
  2. Babukartik, R G & Dhavachelvan P. ,2012, 'Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling', International Journal of Information Technology Convergence and Services, vol. 2, No. 4, pp. 1-10
  3. Ebrahimi. M, Fatemi S. M. T. , Karimi B. , 2014, 'Hybrid Flow Shop Scheduling with sequence dependent family setup time and uncertain due dates', Journal of Applied Mathematical Modeling, Vol. 38 (2014), pp. 2490-2504.
  4. Gupta, J N D, Hariri et al. , 1997, 'Scheduling a two-stage hybrid flow shop with parallel machines at the first stage', Annals of Operations Research, vol. 69, pp. 171 – 191.
  5. Imma Ribas, Rainer Leisten, Jose M. Framinan , 2010, 'Review and Classification of hybrid flow shop scheduling problems from a production system and a solution procedure perspective', Journal of Computers & Operations Research, Vol. 37 (2010), pp. 1439-1454.
  6. Kenneth R. Baker ,2013, 'Minimizing earliness and tardiness costs in stochastic scheduling', European journal of operation research,Vol. 236 (2014),pp. 445–452.
  7. Kanagaraj, G, Ponnambalam, S G & Jawahar, N 2013, 'A hybrid Cuckoo Search and genetic algorithm for reliability– redundancy allocation problems', Computers & Industrial Engineering, pp. 1-10
  8. Li-Ning Xing,Ying-WuChen,Peng Wang,Qing-Song Zhao,Jian Xiong, 2010, 'A Knowledge Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems', Journal of Applied soft Computing, vol. 10, pp. 888-896. .
  9. Marichelvam, M, Prabaharan, T, & Yang, X S 2014, 'Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan', vol. 19, Applied Soft Computing, pp. 93-101.
  10. Ruben Ruiz , Jose Antonio,Vazquez-Rodriguez 2010,'The Hybrid flow shop Scheduling problem', European Journal of Operation Research, Vol. 205 (2010), pp. 1-18.
  11. RuiXua,HuapingChena,XuepingLi(2013),'A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system', Journal of production economics, Vo1. 134(2013),pp. 371-386.
  12. Wang, S & Liu, M 2013, 'A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem', Computers & Operations Research, vol. 40, pp. 1064-1075.
Index Terms

Computer Science
Information Sciences

Keywords

Flexible Flow shop Ant Colony Algorithm Cuckoo Search Makespan minimization.

Powered by PhDFocusTM