Comparisons of bi-objective genetic algorithms for hybrid flowshop scheduling with sequence-dependent setup times

International Journal of Production Research

Volumn 50, Issue 10, 2012, Pages 2570-2591

  Mousavi, S M ^a   Zandieh, M ^b   Amiri, M ^c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

^c ALLAMEH TABATABA'I UNIVERSITY   (Iran)

Author keywords

Bi objective hybrid flowshop scheduling; Crowding distance; Genetic algorithm; TOPSIS; Weighted sum

Indexed keywords

EID: 85015526598     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.543178     Document Type: Article

References (41)

1. Arroyo, J.E.C. and Armentano, V.A., 2005. Genetic local search for multi-objective flow shop scheduling problems. European Journal of Operational Research, 167 (3), 717-738.
2. Bagchi, T.P., 1999. Multi-objective scheduling by genetic algorithms. Boston, MA: Kluwer.
3. Behnamian, J., Fatemi Ghomi, S.M.T., and Zandieh, M., 2009. A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Systems with Applications, 36 (8), 11057-11069.
4. Braglia, M. and Grassi, A., 2009. A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research, 47 (1), 273-288.
5. Chang, P.-C., Chen, S.H., and Lin, K.L., 2005. Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Systems with Applications, 29 (3), 705-712.
6. Chang, P.-C., Chen, S.-H. and Hsieh, J.-C., 2006. A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem. In: Advances in natural computation (LNCS) 4221/2006. Berlin: Springer, 730-739. [Proceedings of the second international conference on advances in natural computation, ICNC 2006 part I, 24-28 September Xi’an, China].
7. Cochran, J.K., Horng, S., and Fowler, J.W., 2003. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research, 30 (7), 1087-1102.
8. Corne, D.W., Knowles, J.D. and Oates, M.J., 2000. The Pareto envelope based selection algorithm for multi-objective optimization. In: Proceedings of the parallel problem solving from nature VI conference, Springer Lecture Notes in Computer Science, Volume 1917/2000, 839-848.
9. Corne, D.W., et al., 2001. PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference, (GECCO-2001). San Francisco, CA: Morgan Kaufmann, 283-290.
10. Deb, K., et al., 2002. A fast and elitist multi-objective genetic algorithm: NSGA II. IEEE Transaction on Evolutionary Computation, 6 (2), 182-197.
11. Fisher, M.L., 1976. A dual algorithm for the one-machine scheduling problem. Mathematical Programming, 11 (1), 229-251.
12. Fonseca, C.M. and Fleming, P.J., 1993. Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, July 1993. San Mateo, CA: Morgan Kaufmann, 416-423.
13. Goldberg, D.E., 1989. Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison Wesley.
14. Holland, J.H., 1975. Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
15. Horn, J., Nafpliotis, N. and Goldberg, D.E., 1994. A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the 1st IEEE-ICEC conference, Computational Computation, 27-29 June 1994, Orlando, FL, Volume 1, 82-87.
16. Hsieh, J.C., 2005. Development of grid-partitioned objective space algorithm for flowshop scheduling with multiple objectives. In: Proceedings of the 6th Asia Pacific industrial engineering and management systems conference 2005, 4-7 December 2005, Manilla, Philippines.
17. Hwang, C.L. and Yoon, K., 1981. Multiple attribute decision making: methods and applications. New York: Springer.
18. Hyun, C.J., Kim, Y., and Kim, Y.K., 1998. A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Computers and Operations Research, 25 (7-8), 675-690.
19. Ishibuchi, H. and Murata, T., 1998. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transaction on Systems and Manufacturing Cybernetics, 28 (3), 392-403.
20. Jungwattanakit, J., et al., 2007. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology, 37 (3-4), 354-370.
21. Knowles, J.D. and Corne, D.W., 1999. The Pareto archived evolution strategy: a new baseline algorithm for multiobjective optimization. In: Proceedings of the 1999 congress on evolutionary computation, 6-9 July, Washington, DC. Washington, DC: IEEE Service Center, 98-105.
22. Kurz, M.E. and Askin, R.G., 2001. Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research, 39 (16), 3747-3769.
23. Murata, T., Ishibuchi, H., and Tanaka, H., 1996. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers and Industrial Engineering, 30 (4), 957-968.
24. Naderi, B., Zandieh, M., and Roshanaei, V., 2008. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. International Journal of Advanced Manufacturing Technology, 41 (11-12), 1186-1198.
25. Naderi, B., Zandieh, M., and Fatemi Ghomi, S.M.T., 2009. Scheduling job shop problems with sequence-dependent setup times. International Journal of Production Research, 47 (21), 5959-5976.
26. Oliver, I.M., Smith, D.J. and Holland, J.R.C., 1987. A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the second international conference on genetic algorithms and their application (ICGA 1987), 28-31 July, MIT, Cambridge, MA. Hillsdale, NJ: L. Erlbaum Associates, 224-230.
27. Pasupathy, T., Rajendran, C., and Suresh, R.K., 2007. A multi-objective genetic algorithm for scheduling in flowshops to minimize the makespan and total flow time of jobs. Intentional Journal of Advanced Manufacturing Technology, 27 (7-8), 804-815.
28. Rahimi-Vahed, A.R., et al., 2007. A multi-objective scatter search for a mixed-model assembly line sequencing problem. Advanced Engineering Informatics, 21 (1), 85-99.
29. Ruiz, R. and Marato, C., 2006. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169 (3), 781-800.
30. Ruiz-Torres, A.J. and Lopez, F.J., 2004. Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling. Computers & Industrial Engineering, 47 (2-3), 107-121.
31. Schaffer, J.D., 1985. Multi-objective optimization with vector evaluated genetic algorithms. In: J. Grefenstette, ed. Proceedings of the international conference on genetic algorithms and their applications, Hillsdale, New Jersey: Lawrence Erlbaum, 93-100.
32. Srinivas, N. and Deb, K., 1995. Multi-objective function optimization using non-dominated sorting genetic algorithms. IEEE Transactions on Evolutionary Computation, 2 (3), 221-248.
33. Syswerda, G., 1990. Schedule optimization using genetic algorithms. In: L. Davis, ed. Handbook of genetic algorithms. New York: Van Nostrand Reinhold, 332-349.
34. Tagami, T. and Kawabe, T., 1998. Genetic algorithm with a Pareto partitioning method for multiobjective flowshop scheduling. In: Proceedings of the 1998 international symposium of nonlinear theory and its applications (NOLTA), 14-17 September 1998, Crans-Montana, Switzerland, 1069-1072.
35. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R. and Mirzaei, A.H., 2007a. Solving a bi-criteria permutation flowshop problem using immune algorithm. In: Proceedings of the first IEEE symposium on computational intelligence, vol. 1, 1-5 April, Honolulu, Hawaii, 49-56.
36. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R., and Mirzaei, A.H., 2007b. A hybrid multi-objective immune algorithm for a flowshop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences, 177 (22), 5072-5090.
37. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R., and Mirzaei, A.H., 2008. Solving a multi-objective no-wait flowshop scheduling problem with an immune algorithm. International Journal of Advanced Manufacturing Technology, 36 (9-10), 969-981.
38. Tavakkoli-Moghaddam, R., et al., 2009. Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers & Operations Research, 36 (12), 3224-3230.
39. Zandieh, M., Fatemi Ghomi, S.M.T., and Moattar Husseini, S.M., 2006. An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180 (1), 111-127.
40. Zitzler, E. and Thiele, L., 1999. Multi-objective evolutionary algorithm: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3 (4), 251-257.
41. Zitzler, E., Laumanns, M. and Thiele, L., 2001. SPEA2: improving the strength Pareto evolutionary algorithm. Report 103. Computer Engineering and Networks Laboratory (TIK), Zurich.