A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 2, 2014, Pages 301-305

  Marichelvam, Mariappan Kadarkarainadar ^a   Prabaharan, Thirumoorthy ^b   Yang, Xin She ^c  

^a KAMARAJ COLLEGE OF ENGINEERING AND TECHNOLOGY   (India)

^b MEPCO SCHLENK ENGINEERING COLLEGE   (India)

^c MIDDLESEX UNIVERSITY   (United Kingdom)

Author keywords

Discrete firefly algorithm (DFA); heuristics; hybrid flowshop scheduling (HFS); makespan; mean flow time; metaheuristics

Indexed keywords

BIOLUMINESCENCE; HEURISTIC ALGORITHMS; SCHEDULING ALGORITHMS;

FIREFLY ALGORITHMS; HEURISTICS; HYBRID FLOW-SHOP SCHEDULING (HFS); MAKESPAN; MEAN FLOW TIME; META HEURISTICS;

SCHEDULING;

EID: 84897492572     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2013.2240304     Document Type: Article

References (45)

1. M. Pinedo, Scheduling Theory, Algorithms and Systems, Englewood Cliffs, NJ, USA: Prentice-Hall, 1995.
2. T. S. Arthanari and K. G. Ramamurthy, "An extension of two machines sequencing problem," Oper. Res., vol. 8, no. 4, pp. 10-22, 1971.
3. J. N. D. Gupta, "Two-stage, hybrid flowshop scheduling problem," J. Oper. Res. Soc., vol. 39, no. 4, pp. 359-364, Apr. 1988.
4. J. A. Hoogeveen, J. K. Lenstra, and B. Veltman, "Preemptive scheduling in a two-stage flow shop NP-hard," Eur. J. Oper. Res., vol. 89 no. 1, pp. 172-175, Feb. 1996. (Pubitemid 126386771)
5. C. Rajendran and D. Chaudhuri, "A multi-stage parallel-processor flowshop problem with minimum flowtime," Eur. J. Oper. Res., vol. 57, no. 1, pp. 111-122, Feb. 1992.
6. A. Guinet, M. M. Solomon, P. K. Kedia, and A. Dussauchoy, "A computational study of heuristics for two-stage flexible flowshops," Int. J. Production Res., vol. 34, no. 5, pp. 1399-1415, May 1996. (Pubitemid 126525266)
7. Y. Yang, S. Kreip, and M. Pinedo, "Heuristics for minimizing total weighted tardiness in flexible flow shops," J. Scheduling, vol. 3, no. 2, pp. 89-108, Mar./Apr. 2000.
8. C. Oguz, M. F. Ercan, T. C. E. Cheng, and Y. F. Fung, "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flowshop," Eur. J. Oper. Res., vol. 149, no. 2, pp. 390-403, Sep. 2003.
9. E. Neron, P. Baptiste, and J. N. D. Gupta, "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, vol. 29, no. 6, pp. 501-511, Dec. 2001. (Pubitemid 33628766)
10. A. Babayan and D. He, "Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach," Int. J. Production Res., vol. 42, no. 4, pp. 777-799, Feb. 2004.
11. D. Alisantoso, L. P. Khoo, and P. Y. Jiang, "An immune algorithm approach to the scheduling of a flexible PCB flow shop," Int. J. Advanced Manufacturing Technol., vol. 22, no. 11-12, pp. 819-827, 2003.
12. O. Engin and A. Doyen, "A new approach to solve hybrid flow shop scheduling problems by artificial immune system," Future Generation Comput. Syst., vol. 20, no. 6, pp. 1083-1095, Aug. 2004.
13. T. Yang, Y. Kuo, and I. Chang, "Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors-A case study," Int. J. Production Res., vol. 42, no. 19, pp. 4015-4030, Oct. 2004.
14. L. Tang and X. Wang, "A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers," Comput. Oper. Res., vol. 36, no. 3, pp. 907-918, Mar. 2009.
15. F. S. Serifoglu and G. Ulusoy, "Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach," J. Oper. Res. Soc., vol. 55, no. 5, pp. 504-512, May. 2004.
16. C. Oguz and M. F. Ercan, "A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks," J. Scheduling, vol. 8, no. 4, pp. 323-351, Jul. 2005. (Pubitemid 40878783)
17. R. Ruiz and C. Maroto, "A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility," Eur. J. Oper. Res., vol. 169, no. 3, pp. 781-800, Mar. 2006 (Pubitemid 41492016)
18. K. Belkadi, M. Gourgand, and M. Benyettou, "Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem," J. Appl. Math. Decision Sci., vol. 2006, pp. 1-17, Aug. 2006.
19. D. F. Shiau, S. C. Cheng, and Y. M. Huang, "Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm," Expert Syst. Appl., vol. 34, no. 2, pp. 1133-1143, Feb. 2008.
20. C. Kahraman, O. Engin, I. Kaya, and M. Yilmaz, "An application of effective genetic algorithms for solving hybrid flow shop scheduling problems," Int. J. Comput. Intell. Syst., vol. 1, no. 2, pp. 134-147, May 2008.
21. E. Rashidi, M. Jahandar, and M. Zandieh, "An improved hybrid multiobjective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines," Int. J. Adv. Manufacturing Technol., vol. 49, no. 9-12, pp. 1129-1139, 2010.
22. K. C. Ying and S. W. Lin, "Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach," Int. J. Production Res., vol. 44, no. 16, pp. 3161-3177, Aug. 2006.
23. S. Khalouli, F. Ghedjati, and A. Hamzaoui, "A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop," Eng. Appl. Artif. Intell., vol. 23, no. 5, pp. 765-771, 2010.
24. C. T. Tseng and C. J. Liao, "A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks," Int. J. Production Res., vol. 46, no. 17, pp. 4655-4670, Sep. 2008.
25. L. Tang and X. Wang, "An improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industry," IEEE Trans. Control Syst. Technol., vol. 18, no. 6, pp. 1303-1314, Nov. 2010.
26. M. R. Singh and S. S. Mahapatra, "A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks," Int. J. Adv. Manuf. Technol., vol. 62, nos. 1-4, p. 267, 2011.
27. H. M. Wang, F. D. Chou, and F. C. Wu, "A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan," Int. J. Adv. Manuf. Technol., vol. 53, no. 5-8, pp. 761-776, 2011.
28. J. Jungwattanakit, M. Reodecha, P. Chaovalitwongse, and F. Werner, "A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria," Comput. Oper. Res., vol. 36, no. 2, pp. 358-378, Feb. 2009.
29. R. Ruiz and J. A. Vazquez-Rodriguez, "The hybrid flow shop scheduling problem," Eur. J. Oper. Res., vol. 205, no. 1, pp. 1-18, Aug. 2010.
30. X. S. Yang, Nature-Inspired Metaheuristic Algorithm. Bristol, U.K.: Luniver, 2008.
31. X. S. Yang, "Firefly algorithms for multimodal optimization," in Proc. SAGA, LNCS 5792, 2009, pp. 169-178.
32. S. Lukasik and S. Zak, "Firefly algorithm for continuous constrained optimization tasks," in Proc. ICCCI, vol. 5796. Oct. 2009, pp. 97-106.
33. X. S. Yang, "Firefly algorithm, stochastic test functions and design optimization," Int. J. Bio-Inspired Comput., vol. 2, no. 2, pp. 78-84, 2010.
34. M. K. Sayadia, R. Ramezaniana, and N. Ghaffari-Nasab, "A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems," Int. J. Industrial Eng. Comput., vol. 1, no. 1, pp. 1-10, 2010.
35. N. Chai-ead, P. Aungkulanon, and P. Luangpaiboon, "Bees and firefly algorithms for noisy non-linear optimization problems," in Proc. Int. MultiConf. Eng. Comput. Scientists, 2011, pp. 1449-1454.
36. H. Banati and M. Bajaj, "Firefly based feature selection approach," Int. J. Comput. Sci. Issues, vol. 8, no. 2, pp. 473-480, Jul. 2011.
37. T. Apostolopoulos and A. Vlachos, "Application of the firefly algorithm for solving the economic emissions load dispatch problem," Int. J. Combinatorics, vol. 2011. pp. 1-23, Dec. 2011.
38. B. Basu and G. K. Mahanti, "Firefly and artificial bees colony algorithm for synthesis of scanned and broadside linear array antenna," Progress Electromagn. Res. B., vol. 32, pp. 169-190, 2011.
39. A. H. Gandomi, X. S. Yang, and A. H. Alavi, "Mixed variable structural optimization using firefly algorithm," Comput. Structures, vol. 89, no. 23-24, pp. 2325-2336, Dec. 2011.
40. S. Kazemzadeh Azad and S. Kazemzadeh Azad, "Optimum design of structures using an improved firefly algorithm," Int. J. Optimization Civil Eng., vol. 1, no. 2, pp. 327-340, 2011.
41. G. K. Jati and S. Suyanto, "Evolutionary discrete firefly algorithm for travelling salesman problem," in Proc. ICAIS2011, LNAI 6943, pp. 393-403, 2011.
42. A. Khadwilard, S. Chansombat, T. Thepphakorn, P. Thapatsuwan, W. Chainat, and P. Pongcharoen, "Application of firefly algorithm and its parameter setting for job shop scheduling," J. Ind. Technol., vol. 8, no. 1, Jan.-Apr. 2012.
43. X. S. Yang, S. S. Hosseini, and A. H. Gandomi, "Firefly algorithm for solving non-convex economic dispatch problems with valve loading effect," Appl. Soft Comput., vol. 12, no. 3, pp. 1180-1186, 2012.
44. J. C. Bean, "Genetic algorithm and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, no. 2, pp. 154-160, 1994.
45. M. Faith Tasgetiren, Y. C. Liang, M. Sevkli, and G. Gencyilmaz, "A particle swarm optimization algorithm for makespan and total flowtime in the permutation flowshop sequencing problem," Eur. J. Oper. Res., vol. 177, pp. 1930-1947, 2007. (Pubitemid 44780934)