Apply the discrete artificial bee colony algorithm to the blocking flow shop problem with makespan criterion

Proceedings of the 2011 Chinese Control and Decision Conference, CCDC 2011

Volumn , Issue , 2011, Pages 2131-2135

  Han, Yu Yan ^a   Duan, Jun Hua ^a   Zhang, Min ^a  

^a LIAOCHENG UNIVERSITY   (China)

Author keywords

blocking flow shop scheduling; discrete artificial bee colony algorithm; local search

Indexed keywords

ARTIFICIAL BEE COLONIES; BLOCKING FLOW; COMPUTATIONAL RESULTS; DISCRETE OPERATORS; FOOD SOURCES; INITIAL POPULATION; INSERT NEIGHBORHOOD; LOCAL SEARCH; MAKESPAN CRITERION; SCHEDULING PROBLEM;

MACHINE SHOP PRACTICE; MATHEMATICAL OPERATORS; SCHEDULING ALGORITHMS;

COMPUTATIONAL EFFICIENCY;

EID: 80052229421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2011.5968558     Document Type: Conference Paper

References (16)

1. R Storn, K Price., "Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces," Journal of Global Optimization, vol. 11, pp. 341-59, 1997.
2. A Allahverdi, C. T Ng, Cheng, T. C. E., et al, "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, vol. 187, pp. 985-1032, 2008.
3. Ling Wang, Quan-Ke Pan, M.F. Tasgetiren, "Minimizing the total flow time in al flow shop with blocking by using hybrid harmony search algorithms", Expert Systems with Applications, 2010 in press
4. DP Ronconi, "A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking," Annals of Operations Research, vol. 138, pp. 53-65, 2005.
5. DP Ronconi, "A note on constructive heuristics for the flowshop problem with blocking," International Journal of Production Economics, vol. 87, pp. 39-48, 2004.
6. R Leisten, "Flowshop sequencing problems with limited buffer storage," International Journal of Production Research, vol. 28, pp. 2085-2100, 1990
7. ST McCormich, ML Pinedo, S Shenker, B Wolf, "Sequencing in an assembly line with blocking to minimize cycle time," Operations Research, vol. 37, pp. 925-36, 1989.
8. F. Della Croce, M. Ghirardi, R. Tadei, "An improved branch-and-bound algorithm for the two machine total completion time flow shop problem," European Journal of Operational Research, vol. 139, pp. 293-301, 2002.
9. V Caraffa, S Ianes, TP Bagchi, C Sriskandarajah, "Minimizing makespan in a blocking flowshop using genetic algorithms," International Journal of Production Economics, vol. 70, pp. 102-115, 2001.
10. J Grabowski, J Pempera, "The permutation flow shop problem with blocking," A tabu search approach, vol. 35, pp. 302-311, 2007.
11. Q.K. Pan, M.F. Tasgetiren, Y.C. Liang, "A discrete differential evolution algorithm for the permutation flowshop scheduling problem," Computers and Industrial Engineering, vol. 55, pp. 795-816, 2008.
12. D. Karaboga, "An idea based on honey bee swarm for numerical optimization,Technical Report TR06," Computer Engineering Department, Erciyes University,Turkey, 2005.
13. Q.K. Pan, M.F. Tasgetiren, P.N.Suganthan, T.J.Chua, "A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem," Infromation Sciences, 2010, in press.
14. Ling Wang, Quan-Ke Pan, P.N.Suganthan, Wen-Hong Wang, Ya-Min Wang, "A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems," Computers &Operations Research, vol. 37, pp. 509-520, 2010
15. L. Wang, "Shop Scheduling with Genetic Algorithms," Tsinghua Univ Press, Beijing, China, 2003
16. E Taillard, "Benchmarks for basic scheduling problems," European Journal of Operational Research, vol. 64, pp.:278-285, 1993