A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Tasgetiren, M Fatih ^a   Pan, Quan Ke ^b   Suganthan, P Nagaratnam ^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

[No Author keywords available]

Indexed keywords

ARTIFICIAL BEE COLONIES; CPU TIME; DIFFERENTIAL EVOLUTION; DISTRIBUTION ALGORITHMS; HYBRID GENETIC; ITERATED LOCAL SEARCH; NEIGHBORHOOD STRUCTURE; OPERATIONAL RESEARCH; PERMUTATION FLOW-SHOP SCHEDULING; SOLUTION QUALITY; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH;

ARTIFICIAL INTELLIGENCE; BIOLOGY;

EVOLUTIONARY ALGORITHMS;

EID: 79959466769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586300     Document Type: Conference Paper

References (36)

1. Jarboui B., Eddaly M., Siarry P., An estimation of distribution algorithm forminimizing the total flowtime in permutation flowshop scheduling problems. Computers and Operations Research 36 (2009) 2638-2646
2. Tseng L.-Y., Lin Y.-T., A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 198 (2009) 84-92
3. Chung C.S., Flynn J., Kirca O., 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)
4. Van de Velde S.L., 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.
5. Bansal S.P., Minimizing the sum of completion times of n-jobs over m-machines in a flowshop - a branch and bound approach. AIIE Transactions 9 (1977) 306-311.
6. Ignall E., Schrage L., Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research 13 (1965) 400-412.
7. Woo H.S., Yim D.S., A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research 25 (1998) 175-182.
8. Framinan J.M., Leisten R., An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31 (2003) 311-317. (Pubitemid 36742549)
9. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452.
10. Ho C.J., Gupta J.N.D., Flowshop scheduling with dominant machines. Computers and Operations Research 22 (1995) 237-246.
11. Framinan J.M., Leisten R., Ruiz-Uzano R., Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 32 (2005) 1237-1254.
12. Rajendran C., Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 (1993) 65-73. (Pubitemid 23623618)
13. Allahverdi A., Aldowaisan T., New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77 (2002) 71-83. (Pubitemid 34284488)
14. Li X., Wang Q., Wu C., Efficient composite heuristics for total flowtime minimization in permutation flowshops. Omega 37 (2009) 155-164.
15. Vempati V.S., Chen C.L., Bulllngton S.F., An effective heuristic for flow shop problems with total flow time as criterion. Computers and Industrial Engineering 25 (1993) 219-222.
16. Zhang Y., Li X., Wang Q., Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research 196 (2009) 869-876.
17. Gajpal Y., Rajendran C., 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)
18. Rajendran C., Ziegler H., Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438.
19. Jarboui B., Ibrahim S., Siarry P., Rebai A., A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers and Industrial Engineering 54 (2008) 526-538. (Pubitemid 351199803)
20. Tasgetiren M.F., Liang Y.-C., Sevkli M., Gencyilmaz G., 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)
21. Tasgetiren M.F., Sevkli M., Liang Y.-C., Gencyilmaz G., Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Proceedings of Ant Colony Optimization and Swarm Intelligence (ANTS2004), LNCS 3172, 2004, Springer-Verlag, pp. 381-389.
22. Pan Q.K., Tasgetiren M.F., Liang Y.-C., A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering 55 (2008) 795-816.
23. Dong X., Huang H., Chen P., An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers and Operations Research 36 (2009) 1664-1669
24. Karaboga D., A new design method based on artificial bee colony algorithm for digital IIR filters. Journal of the Franklin Institute 346 (2009) 328-348.
25. Karaboga D., Basturk B., On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing 8 (2008) 687-697. (Pubitemid 47374599)
26. Karaboga D., Akay B., A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214 (2009) 108-132.
27. Karaboga D., An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
28. Karaboga D., Basturk B., A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39 (2007) 459-471. (Pubitemid 47551831)
29. Nawaz M., Enscore Jr. E. E., Ham I. A., Heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11(1) (1983) 91-95. (Pubitemid 13193807)
30. Ruiz R., Stützle T., A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3) (2007) 2033-2049. (Pubitemid 44712036)
31. Storn R., Price K., Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, Technical Report TR-95-012, 1995.
32. Tasgetiren M.F., Pan Q.-K., Liang Y.-C., A discrete differential evlution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers and Operations Research 36 (2009) 1900-1915.
33. Lozano J.A., Larranaga P., Inza I., Bengoetxea E., Towards a New Evolutionary Computation Advances on Estimation of Distribution Algorithms. Berlin: Springer; 2006.
34. Mladenovic N., Hansen P., Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100.
35. Taillard E., Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285. (Pubitemid 23599340)
36. Pan Q-K, Tasgetiren MF, Suganthan P. N, Chua TJ, A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem, Inform. Sci. (2010), doi:10.1016/j.ins.2009.12.025