İş yükü dengelemeli ikinci tip basit montaj hattı dengeleme problemi için bir tabu arama algoritması

Yıl 2017, , 1169 - 1180, 08.12.2017

Murat Arıkan

https://doi.org/10.17341/gazimmfd.369529

Cited By: 2

Öz

Bu
çalışmada, iki amaçlı tip-2 basit montaj hattı dengeleme probleminin çözümü
için bir tabu arama algoritması geliştirilmiştir. Algoritma, aynı problem için
genellikle evrimsel algoritmalarda yararlanılan göreve yönelik bir çözüm
temsilini kullanmakta ve kalıcılık sıklığına dayalı bir çeşitlendirme
stratejisiyle desteklenmektedir. Algoritmanın performansı, açık literatürden
alınmış 9 probleme ait 23 örnek üzerinde test edilmiştir. Hesaplama sonuçları,
her iki amaç için de algoritmanın etkinliğini doğrulamaktadır.

Anahtar Kelimeler

Montaj hattı dengeleme, tip-2 basit montaj hattı dengeleme problemi, tabu arama

Kaynakça

• 1. Scholl A., Voß S., Simple Assembly Line Balancing – Heuristic Approaches, Journal of Heuristics, 2, 217-244, 1996.
• 2. Rachamadugu R. ve Talbot B., Improving the equality of workload assignments in assembly lines, Int. J. Prod. Res., 29 (3), 619-633, 1991.
• 3. Mastor A.A., An experimental investigation and comparative evaluation of production line balancing techniques, Manage. Sci., 16 (11), 728-746, 1970.
• 4. Gehrline W.V. ve Patterson J.H., Sequencing for assembly lines with integer task times, Manage. Sci., 21 (9), 1064-1070, 1975.
• 5. Hackman S.T., Magazine M.J., Wee T.S., Fast, effective algorithms for simple assembly line balancing problems, Oper. Res., 37, 916-924, 1989.
• 6. Klein R. ve Scholl A., Maximizing the production rate in simple assembly line balancing – A branch and bound procedure, Eur. J. Oper. Res., 91, 367-385, 1996.
• 7. Uğurdağ H.F., Rachamadugu R., Papachristou C.A., Designing paced assembly lines with fixed number of stations, Eur. J. Oper. Res., 102, 488-501, 1997.
• 8. Liu S.B., Ong H.L., Huang H.C., Two bi-directional heuristics for the assembly line type II problem, Int. J. Adv. Manuf. Technol., 22, 656-661, 2003.
• 9. Kılınçcı Ö., A petri-net based heuristic for simple assembly line balancing problem of type 2, Int. J. Adv. Manuf. Technol., 46, 329-338, 2010.
• 10. Blum C., Iterative beam search for simple assembly line balancing with a fixed number of work stations, Statistics and Operations Research Transactions, 35(2), 145-164, 2011.
• 11. La Scalia G., Rosa M., Giuseppe A., Mario E., Solving type-2 assembly line balancing problem with fuzzy binary linear programming, J. Intell. Fuzzy Syst., 25, 517-524, 2013.
• 12. Heinrici A., A comparison between simulated annealing and tabu search with an example from the production planning, Operations Research Proceedings 1994, Editör: Dyckhoff H., Derigs U., Salomon M. ve Tijms H. C., Springer Verlag, Berlin, 498-503, 1994.
• 13. Kim Y.K., Kim Y.J., Kim Y., Genetic algorithms for assembly line balancing with various objectives, Comput. Ind. Eng., 30 (3), 397-409, 1996.
• 14. Nearchou A.C., Balancing large assembly lines by a heuristic based on differential evolution method, Int. J. Adv. Manuf. Technol., 34, 1016-1029, 2007.
• 15. Nearchou A.C., Multi-objective balancing of assembly line by population heuristics, Int. J. Prod. Res., 46 (8), 2275-2297, 2008.
• 16. Nearchou A.C., Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization, Int. J. Prod. Econ.,129, 242-250, 2011.
• 17. Zacharia P.Th. ve Nearchou A.C., Multi-objective fuzzy assembly line balancing using genetic algorithms, J. Intell. Manuf., 23, 615-627, 2012.
• 18. Zheng Q., Li M., Li Y., Tang Q., Station ant colony optimization for the type 2 assembly line balancing problem, Int. J. Adv. Manuf. Technol., 66, 1859-1870, 2013.
• 19. Mozdgir A., Mahdavi I., Badeleh I.S., Solimanpur M., Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing, Math. Comput. Modell., 57, 137-151, 2013.
• 20. Zacharia P.T., Tsirkas S.A., Kabouridis G., Giannopoulos G. I., Planning the construction process of a robotic arm using a genetic algorithm, Int. J. Adv. Manuf. Technol., 79, 1293-1302, 2015.
• 21. Zhang H., Yan Q., Liu Y., Jiang Z., An integer-coded differential evolution algorithm for simple assembly line balancing of type 2, Assembly Autom., 36(3), 246-261, 2016.
• 22. Polat O., Kalaycı C.B., Mutlu Ö., Gupta S.M., A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study, Int. J. Prod. Res., 54 (3), 722-74, 2016.
• 23. Lei D. ve Guo X., Variable neighborhood search for the second type of two-sided assembly line balancing problem, Comput.Oper. Res.,72, 183–188, 2016.
• 24. Rabbani M., Mousavi Z., Asl H.F., Multi-objective metaheuristics for solving a type II robotic mixed-model assembly line balancing problem, J. Ind. Prod. Eng., 33 (7), 472-484, 2016.
• 25. Roshani A. ve Giglio D., Simulated annealing algorithms for the multi-manned assembly line balancing problem: minimising cycle time, Int. J. Prod. Res., 55 (10), 2731-2751, 2017.
• 26. Şahin M. ve Kellegöz T., An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate, Memetic Comp., 9, 213–229, 2017. 27. Driscoll J. ve Thilakawardana D., The definition of assembly line balancing difficulty and evaluation of balance solution quality, Rob. Comput. Integr. Manuf., 17, 81-86, 2001.
• 28. Scholl A., Data of assembly line balancing problems, Shriften zur Quantitativen Betriebwirtschaftslehre 16/93, TH Darmstadt, 1993.
• 29. Glover F., Tabu Search-Part I, ORSA Journal on Computing, 1 (3), 190-206, 1989.
• 30. Glover F. ve Laguna M., Tabu Search, Kluwer Academic Publishers, Boston, 1997.
• 31. Yağmahan B. ve Emel E., Mixed-model assembly line balancing with smoothing approach based on tabu search algorithm, Journal of the Faculty of Engineering and Architecture of Gazi University, 30 (1), 57-69, 2015.
• 32. Pastor R. ve Ferrer L., An improved mathematical program to solve simple assembly line balancing problem, Int. J. Prod. Res., 47 (11), 2943-2959, 2009.