A Hybrid GA-SA Algorithm for Multi-Objective Sequencing Problem in High-Product Mix Shop-Floor

Article Preview

Abstract:

As globalization has increased in the past few years, many companies attempts to made appropriate strategic decision to meet with this challenge. The problem under study mainly focuses on minimizing overall make-span but additional objectives such as balancing the assembly line and minimizing the variation of completion time are also considered. Due to the complexity of problem solving procedure by mathematical techniques, this paper presents a new approach of hybrid GA-SA implementation in order to meet the problem objectives. A proposed hybrid GA-SA is executed to overcome the problem complexity and meet the problem objectives. In order to check the efficiency of hybrid search techniques, a comparison is done between the results obtained by hybrid GA-SA and simple GA and the results comparison validates the effectiveness of presented hybrid search techniques.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3964-3971

Citation:

Online since:

October 2011

Export:

Price:

[1] J. Stevenson William, Operation Management, McGraw-Hill international edition, 2005, p.38.

Google Scholar

[2] J. A. Rehg, Computer-integrated manufacturing: Prentice Hall, (1994).

Google Scholar

[3] D. R. Sule, Industrial scheduling, 20 Park Plaza, Co Boston: PWS Publishing Company. , (1997).

Google Scholar

[4] A. S. Simaria, and P. M. Vilarinho, 2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines, Computers & Industrial Engineering, vol. 56, no. 2, pp.489-506, (2009).

DOI: 10.1016/j.cie.2007.10.007

Google Scholar

[5] Y. K. Kim, C. J. Hyun, and Y. Kim, Sequencing in mixed model assembly lines: A genetic algorithm approach, Computers & Operations Research, vol. 23, no. 12, pp.1131-1145, (1996).

DOI: 10.1016/s0305-0548(96)00033-0

Google Scholar

[6] S. Karabati, and S. Sayin, Assembly line balancing in a mixed-model sequencing environment with synchronous transfers, European Journal of Operational Research, vol. 149, no. 2, pp.417-429, (2003).

DOI: 10.1016/s0377-2217(02)00764-6

Google Scholar

[7] M. Sakawa, and R. Kubota, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, European Journal of Operational Research, vol. 120, no. 2, pp.393-407, (2000).

DOI: 10.1016/s0377-2217(99)00094-6

Google Scholar

[8] P. McMULLEN, and G. Frazier, A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line, Iie Transactions, vol. 32, no. 8, pp.679-686, (2000).

DOI: 10.1080/07408170008967426

Google Scholar

[9] L. K. Gaafar, and S. A. Masoud, Genetic algorithms and simulated annealing for scheduling in agile manufacturing, International Journal of Production Research, vol. 43, no. 14, pp.3069-3085, (2005).

DOI: 10.1080/00207540412331333414

Google Scholar

[10] V. Sekar, Minimizing the make-span in a high-product mix shop-floor using integer programming, M.S., State University of New York at Binghamton, United States - New York, (2007).

Google Scholar

[11] M. P. Groover, Automation, production systems, and computer-integrated manufacturing, p. ^pp.212-215, Upper Saddle River, N.J.: London : Prentice Hall ; Prentice-Hall International, (2001).

Google Scholar

[12] L. Wang, and D. -Z. Zheng, An effective hybrid optimization strategy for job-shop scheduling problems, Computers & Operations Research, vol. 28, no. 6, pp.585-596, (2001).

DOI: 10.1016/s0305-0548(99)00137-9

Google Scholar

[13] C. Oysu, and Z. Bingul, Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining, Engineering Applications of Artificial Intelligence, vol. 22, no. 3, pp.389-396, (2009).

DOI: 10.1016/j.engappai.2008.10.005

Google Scholar

[14] Z. Michalewicz, Genetic algorithms+ data structures= evolution programs, Charlotte, USA: Springer, (1996).

Google Scholar

[15] A. E. Eiben, and J. E. Smith, Introduction to evolutionary computing, Verlag Berlin Heidelberg New York: Springer, (2003).

Google Scholar

[16] J. J. Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics, vol. 16, no. 1, pp.122-128, (1986).

DOI: 10.1109/tsmc.1986.289288

Google Scholar

[17] Y. Y. Leu, L. A. Matheson, and L. P. Rees, Assembly Line Balancing Using Genetic Algorithms with Heuristic-Generated Initial Populations and Multiple Evaluation Criteria*, Decision Sciences, vol. 25, no. 4, pp.581-606, (1994).

DOI: 10.1111/j.1540-5915.1994.tb00822.x

Google Scholar

[18] B. Naderi, M. Zandieh, A. Khaleghi Ghoshe Balagh et al., An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness, Expert Systems With Applications, (2008).

DOI: 10.1016/j.eswa.2008.09.063

Google Scholar

[19] R. L. Haupt, and S. E. Haupt, Practical genetic algorithms, Hoboken, New Jersy: A John Wiley & Sons, Inc., (1998).

Google Scholar