A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences

Volumn 181, Issue 16, 2011, Pages 3459-3475

  Tasgetiren, M Fatih ^a   Pan, Quan Ke ^b   Suganthan, P N ^c   Chen, Angela H L ^d  

^a YASAR UNIVERSITY   (Turkey)

^b LIAOCHENG UNIVERSITY   (China)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d NANYA INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Discrete artificial bee colony algorithm; Discrete differential evolution algorithm; Estimation of distribution algorithm; Genetic local search; Iterated greedy algorithm; Permutation flowshop scheduling problem

Indexed keywords

ARTIFICIAL BEE COLONIES; DISCRETE DIFFERENTIAL EVOLUTION ALGORITHM; ESTIMATION OF DISTRIBUTION ALGORITHM; GENETIC LOCAL SEARCH; ITERATED GREEDY ALGORITHM; PERMUTATION FLOWSHOP SCHEDULING PROBLEM;

BIOLOGY; HEURISTIC ALGORITHMS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 79957526144     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2011.04.018     Document Type: Article

References (48)

1. B. Akay, and D. Karaboga A modified artificial bee colony algorithm for real-parameter optimization Information Sciences 2010 10.1016/j.ins.2010.07.015
2. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics 77 2002 71 83 (Pubitemid 34284488)
3. T.C.E. Cheng, P.-J. Lai, C.-C. Wu, and W.-C. Lee Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations Information Sciences 179 2009 3127 3135
4. S.P. Bansal Minimizing the sum of completion times of n-jobs over m-machines in a flowshop - a branch and bound approach AIIE Transactions 9 1997 306 311
5. C.S. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems International Journal of Production Economics 79 2002 185 196 (Pubitemid 35039850)
6. X. Dong, H. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers and Operations Research 36 2009 1664 1669
7. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimisation in permutation flow shops Omega 31 2003 311 317 (Pubitemid 36742549)
8. J.M. Framinan, R. Leisten, and R. Ruiz-Uzano Comparison of heuristics for flowtime minimisation in permutation flowshops Computers and Operations Research 32 2005 1237 1254
9. Y. Gajpal, and C. Rajendran An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops International Journal of Production Economics 101 2006 259 272 (Pubitemid 43177614)
10. C.J. Ho, and J.N.D. Gupta Flowshop scheduling with dominant machines Computers and Operations Research 22 1995 237 246
11. E. Ignall, and L. Schrage Application of the branch and bound technique to some flow-shop scheduling problems Operations Research 13 1965 400 412
12. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers and Industrial Engineering 54 2008 526 538 (Pubitemid 351199803)
13. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers and Operations Research 36 2009 2638 2646
14. M. Kang, D.I. Kang, J. Suh, and J. Lee An energy-efficient real-time scheduling scheme on dual-channel networks Information Sciences 178 2008 2553 2563
15. D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
16. D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471 (Pubitemid 47551831)
17. D. Karaboga, and B. Basturk On the performance of artificial bee colony (ABC) algorithm Applied Soft Computing 8 2008 687 697 (Pubitemid 47374599)
18. D. Karaboga A new design method based on artificial bee colony algorithm for digital IIR filters Journal of The Franklin Institute 346 2009 328 348
19. D. Karaboga, and B. Akay A comparative study of artificial bee colony algorithm Applied Mathematics and Computation 2009 10.1016/j.amc.2009.03.90
20. I. Kassabalidis, M.A. El-Sharkawi, R.J. II Marks, P. Arabshahi, A.A. Gray, Swarm intelligence for routing in communication networks, Global Telecommunications Conference, GLOBECOM'01, IEEE 6 (2001) 3613-3617. (Pubitemid 34082673)
21. J. Kennedy, R.C. Eberhart, Y. Shi, Swarm Intelligence, San Mateo, Morgan Kaufmann, CA, USA, 2001.
22. W.C. Lee, and C.C. Wu Some single-machine and m-machine flow shop scheduling problems with learning considerations Information Sciences 179 2009 3885 3892
23. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flowshops Omega 37 2009 155 164
24. L.-Y. Tseng, and Y.-T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 198 2009 84 92
25. L.-Y. Tseng, and Y.-T. Lin A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem International Journal of Production Economics 2010 10.1016/j.ijpe.2010.05.003
26. Ci scheduling problem European Journal of Operational Research 132 2001 439 452 (Pubitemid 32385032)
27. J.A. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea Towards a New Evolutionary Computation Advances on Estimation of Distribution Algorithms 2006 Springer Berlin
28. M. Nawaz, E.E. Enscore Jr., and I.A. Ham Heuristic algorithm for the m-machine, n-job flow shop sequencing problem OMEGA 11 1983 91 95 (Pubitemid 13193807)
29. Q.-K. Pan, M.F. Tasgetiren, P.N. Suganthan, and T.J. Chua A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem Information Sciences 181 2011 2455 2468
30. Q.K. Pan, M.F. Tasgetiren, and Y.-C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers and Industrial Engineering 55 2008 795 816
31. C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1993 65 73 (Pubitemid 23623618)
32. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2004 426 438
33. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 2007 2033 2049 (Pubitemid 44712036)
34. R. Storn, K. Price, Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, Technical Report TR-95-012, 1995.
35. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285 (Pubitemid 23599340)
36. M.F. Tasgetiren, M. Sevkli, Y.-C. Liang, and G. Gencyilmaz Particle swarm optimization algorithm for permutation flowshop sequencing problem Proceedings of Ant Colony Optimization and Swarm Intelligence (ANTS2004), LNCS 3172 2004 Springer-Verlag 381 389
37. M.F. Tasgetiren, Y-C Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 2007 1930 1947 (Pubitemid 44780934)
38. M.F. Tasgetiren, Q-K. Pan, and Y-C. Liang A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan and total flowtime criteria Computers and Operations Research 35 2008 2807 2839 (Pubitemid 351193083)
39. M.F. Tasgetiren, Q-K. Pan, and Y-C. Liang A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times Computers and Operations Research 36 2009 1900 1915
40. V. Tereshko, Reaction-diffusion model of a honeybee colony's foraging behaviour, in: PPSN VI: Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature, Springer-Verlag, London, UK (2000) 807-816.
41. S.L. Van de Velde Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation Annals of Operations Research 26 1990 257 268
42. V.S. Vempati, C.L. Chen, and S.F. Bulllngton An effective heuristic for flow shop problems with total flow time as criterion Computers and Industrial Engineering 25 1993 219 222
43. L. Wang, and D.Z. Zheng An effective hybrid heuristic for flow shop scheduling International Journal of Advanced Manufacturing Technology 21 2003 38 44
44. H.R. Wedde, M. Farooq, The wisdom of the hive applied to mobile ad-hoc networks, in: Swarm Intelligence Symposium, SIS 2005, IEEE Proceedings (2005) 341-348.
45. H.S. Woo, and D.S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers and Operations Research 25 1998 175 182
46. X.S. Yang Engineering optimizations via nature-inspired virtual bee algorithms in: Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, LNCS 3562 2005 317 323
47. Y.Q. Yin, D.H. Xu, K.B. Sun, and H.X. Li Some scheduling problem with general position-dependent and time-dependent learning effects Information Sciences 179 2009 2416 2425
48. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 2008 10.1016/j.ejor.2008.04.033