A solution approach based on beam search algorithm for disassembly line balancing problem

Journal of Manufacturing Systems

Volumn 41, Issue , 2016, Pages 188-200

  Mete, Süleyman ^d   Çil, Zeynel Abidin ^a,b   Ağpak, Kürşad ^a   Özceylan, Eren ^a   Dolgui, Alexandre ^c  

^a GAZIANTEP UNIVERSITY   (Turkey)

^b BATMAN UNIVERSITY   (Turkey)

^c ECOLE DES MINES DE NANTES   (France)

^d University of Munzur   (Turkey)

Author keywords

Beam search; Disassembly line balancing; Meta heuristic

Indexed keywords

OPTIMIZATION;

BEAM SEARCH; BEAM SEARCH ALGORITHMS; DISASSEMBLY LINE BALANCING; META HEURISTIC ALGORITHM; METAHEURISTIC; OPTIMAL SOLUTIONS; PERFORMANCE MEASURE; SOLUTION APPROACH;

HEURISTIC ALGORITHMS;

EID: 84988918149     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmsy.2016.09.002     Document Type: Article

References (64)

1. [1] Güngör, A., Gupta, S.M., Disassembly line balancing. Proceedings of the 1999 Annual Meeting of the Northeast Decision Sciences Institute, 1999, 193–195.
2. [2] Ilgin, M.A., Gupta, S.M., Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art. J Environ Manage 91 (2010), 563–591.
3. [3] McGovern, S.M., Gupta, S.M., The disassembly line: balancing and modeling. 2010, McGraw-Hill, New York.
4. [4] Güngör, A., Gupta, S.M., Disassembly line in product recovery. Int J Prod Res 40:11 (2002), 2569–2589.
5. [5] McGovern, S.M., Gupta, S.M., A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res 179:3 (2007), 692–708.
6. [6] Rekiek, B., Dolgui, A., Delchambre, A., Bratcu, A., State of art of optimization methods for assembly line design. Annu Rev Control 26 (2002), 163–174.
7. [7] Boysen, N., Fliedner, M., Scholl, A., A classification of assembly line balancing problems. Prod Manuf Logist 183:2 (2007), 674–693.
8. [8] Battaïa, O., Dolgui, A., A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142:2 (2013), 259–277.
9. [9] Bentaha, M.L., Dolgui, A., Battaïa, O., A bibliographic review of production line design and balancing under uncertainty. IFAC—Papers Online 48:3 (2015), 70–75.
10. [10] Ding, L.-P., Feng, Y.-X., Tan, J.-R., Gao, Y.C., A new multi-objective ant colony algorithm for solving the disassembly line balancing problem. Int J Adv Manuf Technol 48:5–8 (2010), 761–771.
11. [11] McGovern, S.M., Gupta, S.M., Combinatorial optimization analyses of the unary NP-complete disassembly line balancing problem. Int J Prod Res 45:18 (2007), 4485–4511.
12. [12] Agrawal, S., Tiwari, M.K., A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. Int J Prod Res 46:6 (2008), 1405–1429.
13. [13] Kalaycı, C.B., Gupta, S.M., Nakashima, K., A simulated annealing algorithm for balancing a disassembly line. Design for innovative value towards a sustainable society, 2012, Springer, Netherlands, 714–719.
14. [14] Sabuncuoglu, I., Karabuk, S., A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems. IIE Trans 30 (1998), 179–191.
15. [15] Hezer, S., Kara, Y., A network-based shortest route model for parallel disassembly line balancing problem. Int J Prod Res 53:6 (2015), 1849–1865.
16. [16] Koç, A., Sabuncuoğlu, I., Erel, E., Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Trans 41:10 (2009), 866–881.
17. [17] Lowerre, B.T., The HARPY speech recognition system. Ph.D thesis, 1976, Carnegie Mellon University, Pittsburgh, PA.
18. [18] Matsuda, T., Motoda, H., Yoshida, T., Washio, T., Mining patterns from structured data by beam-wise graph-based induction. Proceedings of the 5th International Conference on Discovery Science Discovery 2534 (2002), 422–429.
19. [19] Ortmanns, S., Ney, H., Look-ahead techniques for fast beam search. Comput Speech Lang 14 (2000), 15–32.
20. [20] Baldi, M., Crainic, T., Perboli, G., Tadei, R., Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items. Ann Oper Res 222:1 (2014), 125–141.
21. [21] Blum, C., Miralles, C., On solving the assembly line worker assignment and balancing problem via beam search. Comput Oper Res 43 (2011), 1411–1426.
22. [22] Sabuncuoglu, I., Gocgun, Y., Erel, E., Backtracking and exchange of information: methods to enhance a beam search algorithm for assembly line scheduling. Eur J Oper Res 186 (2008), 915–930.
23. [23] Shahookar, K., Khamisani, W., Mazumder, P., Reddy, S.M., Genetic beam search for gate matrix layout. Proceedins of the 6th International Conference on VLSI Design, 1993, 208–213.
24. [24] Leu, Y., Using beam search techniques for sequencing mixed-model assembly lines. Ann Oper Res 70 (1997), 379–397.
25. [25] Kim, K.H., Kim, K.Y., Routing straddle carriers for the loading operation of containers using a beam search algorithm. Comput Ind Eng 36 (1999), 109–136.
26. [26] Alexouda, G., Paparrizos, K., A genetic algorithm approach to the product line design problem using the seller's return criterion: an extensive comparative computational study. Eur J Oper Res 134 (2001), 165–178.
27. [27] Zeng, X., Martinez, T.R., Optimization by varied beam search in hopfiled networks. Proceedings of the IEEE International Joint Conference on Neural Networks, 2002, 913–918.
28. [28] Zhou, R., Hansen, E.A., Breadth-first heuristic search. Proceedings of the 14th International Conference on Automated Planning and Scheduling, 2004, 92–100.
29. [29] Erel, E., Sabuncuoğlu, I., Sekerci, H., Stochastic assembly line balancing using beam search. Int J Prod Res 43 (2005), 328–339.
30. [30] Beraldi, P., Ruszczynski, A., Beam search heuristic to solve stochastic integer problems under probabilistic constraints. Eur J Oper Res 167 (2005), 35–47.
31. [31] McMullen, P.R., Tarasewich, P., A beam search heuristic method for mixed-model scheduling with setups. Int J Prod Econ 96 (2005), 273–283.
32. [32] Erel, E., Göçgün, Y., Sabuncuoğlu, I., Mixed-model assembly line sequencing using beam search. Int J Prod Res 45:22 (2007), 5265–5284.
33. [33] Shi-jin, W., Bing-Hai, Z., Li-Feng, X., A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem. Int J Prod Res 46:11 (2008), 3027–3058.
34. [34] Blum, C., Beam-ACO for simple assembly line balancing. INFORMS J Comput 20:4 (2008), 618–627.
35. [35] Özpeynirci, S.B., Azizoglu, M., Beam search algorithm for capacity allocation problem in flexible manufacturing systems. Comput Ind Eng 56 (2009), 1464–1473.
36. [36] Yavuz, M., An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal. Int J Prod Res 48:20 (2010), 6189–6202.
37. [37] Lopez-Ibanez, M., Blum, C., Beam-ACO for the travelling salesman problem with time windows. Comput Oper Res 37 (2010), 1510–1583.
38. [38] Golle, U., Rothlauf, F., Boysen, N., Iterative beam search for car sequencing. Ann Oper Res, 2015, 239–254.
39. [39] Altekin, F.T., Kandiller, L., Özdemirel, N.E., Profit-oriented disassembly line balancing. Int J Prod Res 46:10 (2008), 2675–2693.
40. [40] Kalaycı, C.B., Gupta, S.M., A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. Int J Adv Manuf Technol 69:1–4 (2013), 197–209.
41. [41] Kalaycı, C.B., Gupta, S.M., Ant colony optimization for sequence-dependent disassembly line balancing problem. J Manuf Technol Manage 24:3 (2013), 413–427.
42. [42] Kalaycı, C.B., Gupta, S.M., Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. Expert Syst Appl 40:18 (2013), 7231–7241.
43. [43] Altekin, F.T., Akkan, C., Task-failure-driven rebalancing of disassembly lines. Int J Prod Res 50:18 (2012), 4955–4976.
44. [44] Avikal, S., Mishra, P.K., A new U-shaped heuristic for disassembly line balancing problems. Pratibha: Int J Sci Spiritual Bus Technol 1:1 (2012), 2277–7261.
45. [45] Paksoy, T., Güngör, A., Özceylan, E., Hancilar, A., Mixed model disassembly line balancing problem with fuzzy goals. Int J Prod Res 51:20 (2013), 6082–6096.
46. [46] Avikal, S., Jain, R., Mishra, P., A heuristic for U-shaped disassembly line balancing problems. MIT Int J Mech Eng 3:1 (2013), 51–56.
47. [47] Avikal, S., Mishra, P.K., Jain, R., Yadav, H.C., A PROMETHEE method based heuristic for disassembly line balancing problem. Ind Eng Manage Syst 12:3 (2013), 254–263.
48. [48] Aydemir-Karadağ, A., Türkbey, O., Multi-objective optimization of stochastic disassembly line balancing with station paralleling. Comput Ind Eng 65 (2013), 413–425.
49. [49] Özceylan, E., Paksoy, T., Reverse supply chain optimisation with disassembly line balancing. Int J Prod Res 51:20 (2013), 5985–6001.
50. [50] Tuncel, E., Zeid, A., Kamarthi, S., Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning. J Intell Manuf 25 (2014), 647–659.
51. [51] Kalaycı, C.B., Polat, O., Gupta, S.M., A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. Ann Oper Res 242:2 (2016), 321–354.
52. [52] Kalaycı, C.B., Gupta, S.M., A tabu search algorithm for balancing a sequence-dependent disassembly line. Prod Plann Control 25:2 (2014), 149–160.
53. [53] Avikal, S., Mishra, P.K., Jain, R., A Fuzzy AHP and PROMETHEE method-based heuristic for disassembly line balancing problems. Int J Prod Res 52:5 (2014), 1306–1317.
54. [54] Bentaha, M.L., Battaïa, O., Dolgui, A., A sample average approximation method for disassembly line balancing problem under uncertainty. Comput Oper Res 51 (2014), 111–122.
55. [55] Özceylan, E., Paksoy, T., Bektaş, T., Modelling and optimizing the integrated problem of closed-loop supply chain network design and disassembly line balancing. Transp Res Part E 61 (2014), 142–164.
56. [56] Kalaycı, C.B., Hancılar, A., Güngör, A., Gupta, S.M., Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm. J Manuf Syst 37:3 (2014), 672–682.
57. [57] Kalaycı, C.B., Polat, O., Gupta, S.M., A variable neighborhood search algorithm for disassembly lines. J Manuf Technol Manage 26:2 (2015), 182–194.
58. [58] Bentaha, M.L., Battaïa, O., Dolgui, A., An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times. Int J Prod Res 53:6 (2015), 1807–1818.
59. [59] Bentaha, M.L., Battaïa, O., Dolgui, A., Jack Hu, S., Second order conic approximation for disassembly line design with joint probabilistic constraints. Eur J Oper Res 247 (2015), 957–967.
60. [60] McGovern, S.M., Gupta, S.M., Unified assembly- and disassembly-line model formulae. J Manuf Technol Manage 26:2 (2015), 195–212.
61. [61] Riggs, R.J., Battai, O., Jack Hu, S., Disassembly line balancing under high variety of end of life states using a joint precedence graph approach. J Manuf Syst 37:3 (2015), 638–648.
62. [62] Kalaycılar, E.G., Azizoğlu, M., Yeralan, S., A disassembly line balancing problem with fixed number of workstations. Eur J Oper Res 249:2 (2016), 592–604.
63. [63] De Mello, L.S.H., Sanderson, A.C., AND/OR graph representation of assembly plans. IEEE Trans Robot Autom 6:2 (1990), 188–199.
64. [64] Tang, Y., Zhou, M., Zussman, E., Caudill, R., Disassembly modeling planning, and application. J Manuf Syst 21:3 (2002), 200–217.