Non-dominated ranked genetic algorithm for a multi-objective mixed-model assembly line sequencing problem

International Journal of Production Research

Volumn 49, Issue 12, 2011, Pages 3479-3499

  Moradi, H ^a   Zandieh, M ^b   Mahdavi, Iraj ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

just in time; mixed model assembly line sequencing; non dominated ranked genetic algorithm; Pareto optimal frontier; Taguchi method

Indexed keywords

JUST IN TIME; MIXED-MODEL ASSEMBLY LINES; NON-DOMINATED RANKED GENETIC ALGORITHM; PARETO-OPTIMAL FRONTIER; TAGUCHI;

ASSEMBLY MACHINES; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; PARETO PRINCIPLE; TAGUCHI METHODS;

ASSEMBLY;

EID: 79953821012     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540903433882     Document Type: Article

References (37)

1. Al-Aomar, R., 2006. Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs. Simulation Modeling Practice and Theory, 14(3), 201-223. (Pubitemid 43277668)
2. Al Jadaan, O., Rao, C. R., and Rajamani, L., 2005. Ranked based roulette wheel selection method. ISRAMA2005, Calcutta Mathematical Society.
3. Al Jadaan, O., Rao, C. R., and Rajamani, L., 2006. Parametric study to enhance genetic algorithm performance, using ranked based roulette wheel selection method. InSciT2006, 22, Merida, Spain, Vol. 2, 274-278.
4. Al Jadaan, O., Rajamani, L., and Rao, C. R., 2008. Non-dominated ranked genetic algorithm for solving multi-objective optimisation problems: NRGA. Journal of Theoretical and Applied Information Technology, (2), 60-67.
5. Bard, J. F., Shtub, A., and Joshi, S. B., 1994. Sequencing mixed-model assembly lines to level parts usage and minimise line length. International Journal of Production Research, 32(24), 2431-2454.
6. Bowker, A. H. and Liberman, G. J., 1972. Engineering statistics. 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.
7. Cochran, W. G. and Cox, G. M., 1992. Experimental designs. 2nd ed. New York: Wiley.
8. Coello, C. A. C., Van Veldhuisen, D. A., and Lamont, G. B., 2002. Evolutionary algorithms for solving multi-objective problems. New York: Kluwer Academic Publishers.
9. Deb, K., 2001. Multi-objective optimisation using evolutionary algorithms. Chichester, UK: John Wiley.
10. Deb, K., et al., 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. (Pubitemid 34555372)
11. Fonseca, C. M. and Fleming, P. J., 1993. Genetic algorithms for multi-objective optimisation: formulation, discussion and generalisation. In: S. Forrest, ed. Proceedings of the 5th international conference on genetic algorithms, July 1993, University of Illinois at Urbana-Champaign. San Mateo, California: Morgan Kaufman Publishers, 416-423.
12. Goldberg, D. E., 1989. Genetic algorithms in search, optimisation and machine learning. Reading, MA: Addison Wesley.
13. Horn, J., Nafpliotis, N., and Goldberg, D. E., 1994. A niched Pareto genetic algorithm for multiobjective optimisation. Proceedings of the 1st IEEEICEC conference on evolutionary computation, IEEE World Congress on Computational Intelligence, (1), 82-87.
14. 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.
15. Mansouri, S. A., 2005. A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines. European Journal of Operational Research, 167(3), 696-716. (Pubitemid 40220086)
16. McMullen, P. R., 1998. JIT sequencing for mixed-model assembly lines with setups using tabu search. Production Planning & Control, 9(5), 504-510. (Pubitemid 128624341)
17. McMullen, P. R., 2001a. An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Computers & Industrial Engineering, 41(3), 335-353. (Pubitemid 33018921)
18. McMullen, P. R., 2001b. A Kohonen self-organising map approach to addressing a multiple objective, mixed-model JIT seqencing problem. International Journal of Production Economics, 72(1), 59-71. (Pubitemid 32544410)
19. McMullen, P. R., 2001c. An ant colony optimisation approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence in Engineering, 15(3), 309-317. (Pubitemid 33039204)
20. McMullen, P. R. and Frazier, G. V., 2000. A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line. IIE Transactions, 32(8), 679-686.
21. McMullen, P. R., Tarasewich, P., and Frazier, G. V., 2000. Using genetic algorithms to solve the multi-product JIT sequencing problem with setups. International Journal of Production Research, 38(12), 2653-2670. (Pubitemid 35401821)
22. Michalewicz, Z., 1996. Genetic algorithms+data structures=evolution programs. New York: Springer.
23. Miltenburg, J., Steiner, G., and Yeomans, S., 1990. A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems. Mathematical and Computer Modeling, 13(3), 57-66. (Pubitemid 20693490)
24. Miltenburg, J., 1989. Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science, 35(2), 192-207.
25. Miltenburg, J. and Goldstein, G. T., 1991. Developing production scheduling which balance part usage and smooth production loads in just-in-time production systems. Naval Research Logistics, 38(6), 893-910.
26. Monden, Y., 1993. Toyota production system. 2nd ed. Norcross, GA: Institute of Industrial Engineers Press.
27. Monden, Y., 1997. Toyota production system. 3rd ed. Norcross, GA: Institute of Industrial Engineers Press.
28. Montgomery, D. C., 2000. Design and analysis of experiments. 5th ed. New York: Wiley.
29. Phadke, M. S., 1989. Quality engineering using robust design. Engelwood Cliffs, NJ: Prentice-Hall.
30. Rahimi-Vahed, A. and Mirzaei, A. H., 2007. A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem. Computers & Industrial Engineering, 53(4), 642-666. (Pubitemid 47588649)
31. 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. (Pubitemid 46209840)
32. Ruiz, R., Maroto, C., and Alcaraz, J., 2005. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34-54. (Pubitemid 40135592)
33. Srinivas, N. and Deb, K., 1995. Multiobjective function optimisation using non-dominated sorting genetic algorithms. Evolutionary Computation, 2(3), 221-248.
34. Taguchi, G., 1986. Introduction to quality engineering. White Plains: Asian Productivity Organisation/UNIPUB.
35. Tavakkoli-Moghaddam, R. and Rahimi-Vahed, A. R., 2006. Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system. Applied Mathematics and Computation, 181(2), 1471-1481. (Pubitemid 44646619)
36. Tsai, J. T., et al., 2007. Improved immune algorithm for global numerical optimisation and job-shop scheduling problems. Applied Mathematics and Computation, 194(2), 406-424.
37. Zhu, J. and Ding, F., 2000. A transformed two-stage method for reducing the part-usage variation and a comparison of the product-level and part-level solutions in sequencing mixed-model assembly lines. European Journal of Operational Research, 127(1), 203-216.