A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

Kalayci, Can B.; Polat, Olcay; Gupta, Surendra M.

doi:10.1007/s10479-014-1641-3

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

Published: 19 June 2014

Volume 242, pages 321–354, (2016)
Cite this article

Annals of Operations Research Aims and scope Submit manuscript

Can B. Kalayci¹,
Olcay Polat¹ &
Surendra M. Gupta²

1900 Accesses
117 Citations
5 Altmetric
Explore all metrics

Abstract

For remanufacturing or recycling companies, a reverse supply chain is of prime importance since it facilitates in recovering parts and materials from end-of-life products. In reverse supply chains, selective separation of desired parts and materials from returned products is achieved by means of disassembly which is a process of systematic separation of an assembly into its components, subassemblies or other groupings. Due to its high productivity and suitability for automation, disassembly line is the most efficient layout for product recovery operations. A disassembly line must be balanced to optimize the use of resources (viz., labor, money and time). In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence dependent time increments. A hybrid algorithm that combines a genetic algorithm with a variable neighborhood search method (VNSGA) is proposed to solve the SDDLBP. The performance of VNSGA was thoroughly investigated using numerous data instances that have been gathered and adapted from the disassembly and the assembly line balancing literature. Using the data instances, the performance of VNSGA was compared with the best known metaheuristic methods reported in the literature. The tests demonstrated the superiority of the proposed method among all the methods considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

A Problem Specific Genetic Algorithm for Disassembly Planning and Scheduling Considering Process Plan Flexibility and Parallel Operations

A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time

Article 04 October 2022

Hybrid evolutionary algorithm for stochastic multiobjective disassembly line balancing problem in remanufacturing

Article 28 April 2023

References

Agrawal, S., & Tiwari, M. K. (2008). A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. International Journal of Production Research, 46(6), 1405–1429.
Article Google Scholar
Akpınar, S., & Bayhan, G. M. (2011). A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints. Engineering Applications of Artificial Intelligence, 24(3), 449–457.
Article Google Scholar
Altekin, F. T., & Akkan, C. (2012). Task-failure-driven rebalancing of disassembly lines. International Journal of Production Research, 50(18), 4955–4976.
Article Google Scholar
Altekin, F. T., Kandiller, L., & Ozdemirel, N. E. (2008). Profit-oriented disassembly-line balancing. International Journal of Production Research, 46(10), 2675–2693.
Article Google Scholar
Battaïa, O., & Dolgui, A. (2013). A taxonomy of line balancing problems and their solutionapproaches. International Journal of Production Economics, 142(2), 259–277.
Article Google Scholar
Baybars, İ. (1986). A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32(8), 909–932.
Article Google Scholar
Baykasoglu, A. (2006). Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. Journal of Intelligent Manufacturing, 17(2), 217–232.
Article Google Scholar
Chiang, W.-C. (1998). The application of a tabu search metaheuristic to the assembly line balancing problem. Annals of Operations Research, 77, 209–227.
Article Google Scholar
Ding, L.-P., Feng, Y.-X., Tan, J.-R., & Gao, Y.-C. (2010). A new multi-objective ant colony algorithm for solving the disassembly line balancing problem. The International Journal of Advanced Manufacturing Technology, 48(5–8), 761–771.
Article Google Scholar
Gungor, A., & Gupta, S. M. (1999). Issues in environmentally conscious manufacturing and product recovery: A survey. Computers and Industrial Engineering, 36(4), 811–853.
Article Google Scholar
Gungor, A., & Gupta, S. M. (2002). Disassembly line in product recovery. International Journal of Production Research, 40(11), 2569–2589.
Article Google Scholar
Gupta, S. M., Erbis, E., & McGovern, S. M. (2004). Disassembly sequencing problem: A case study of a cell phone. In S. M. Gupta (Ed.), Environmentally Conscious Manufacturing IV. In Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE) (Vol. 5583, pp. 43–52). Bellingham: SPIE-International Society for Optical Engineering.
Gurevsky, E., Battaïa, O., & Dolgui, A. (2012). Balancing of simple assembly lines under variations of task processing times. Annals of Operations Research, 201(1), 265–286.
Article Google Scholar
Hansen, P., Mladenović, N., & Pérez, J. M. (2010). Developments of variable neighborhood search. Annals of Operations Research, 175(1), 367–407.
Article Google Scholar
Ilgin, M. A., & Gupta, S. M. (2010). Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art. Journal of environmental management, 91(3), 563–591.
Article Google Scholar
Ilgin, M. A., & Gupta, S. M. (2012). Remanufacturing modeling and analysis. Boca Raton: CRC Press.
Book Google Scholar
Kalayci, C. B., & Gupta, S. M. (2011). A hybrid genetic algorithm approach for disassembly line balancing. In Proceedings of the 42nd Annual Meeting of Decision Science Institute (DSI 2011), Boston (Vol. 1, pp. 2142–2148).
Kalayci, C. B., & Gupta, S. M. (2012). A particle swarm optimization algorithm for solving disassembly line balancing problem. In Proceedings for the Northeast Region Decision Sciences Institute (NEDSI) (pp. 347–357). Northeast Decision Sciences Institute.
Kalayci, C. B., & Gupta, S. M. (2013a). Ant colony optimization for sequence-dependent disassembly line balancing problem. Journal of Manufacturing Technology Management, 24(3), 413–427.
Article Google Scholar
Kalayci, C. B., & Gupta, S. M. (2013b). Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. Expert Systems with Applications, 40(18), 7231–7241.
Article Google Scholar
Kalayci, C. B., & Gupta, S. M. (2013c). A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. The International Journal of Advanced Manufacturing Technology, 69(1–4), 197–209.
Article Google Scholar
Kalayci, C. B., & Gupta, S. M. (2003d). Simulated annealing algorithm for solving sequence-dependent disassembly line balancing problem. In IFAC Conference on Manufacturing Modelling, Management, and Control, Saint Petersburg, Russia (pp. 93–98).
Kalayci, C. B., & Gupta, S. M. (2013e). A tabu search algorithm for balancing a sequence-dependent disassembly line. Production Planning and Control, 25(2), 149–160.
Article Google Scholar
Kalayci, C. B., Gupta, S. M., & Nakashima, K. (2011). Bees Colony Intelligence in Solving Disassembly Line Balancing Problem. In Proceedings of the 2011 Asian Conference of Management Science and Applications (ACMSA2011), Sanya (pp. 34–41).
Kalayci, C. B., Gupta, S. M., & Nakashima, K. (2012). A simulated annealing algorithm for balancing a disassembly line. In M. Matsumoto, Y. Umeda, K. Masui, & S. Fukushige (Eds.), Design for innovative value towards a sustainable society (pp. 714–719). New York: Springer.
Chapter Google Scholar
Kilincci, O. (2011). Firing sequences backward algorithm for simple assembly line balancing problem of type 1. Computers and Industrial Engineering, 60(4), 830–839.
Article Google Scholar
Koc, A., Sabuncuoglu, I., & Erel, E. (2009). Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Transactions, 41(10), 866–881.
Article Google Scholar
Kongar, E., & Gupta, S. M. (2005). Disassembly sequencing using genetic algorithm. The International Journal of Advanced Manufacturing Technology, 30(5–6), 497–506.
Google Scholar
Lapierre, S. D., Ruiz, A., & Soriano, P. (2006). Balancing assembly lines with tabu search. European Journal of Operational Research, 168(3), 826–837.
Article Google Scholar
McGovern, S. M., & Gupta, S. M. (2005a). Ant colony optimization for disassembly sequencing with multiple objectives. The International Journal of Advanced Manufacturing Technology, 30(5–6), 481–496.
Google Scholar
McGovern, S. M., & Gupta, S. M. (2005). Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem. In S. M. Gupta (Ed.), Environmentally conscious manufacturing V (1st ed., Vol. 5997, pp. 81–92). Boston: SPIE.
Google Scholar
McGovern, S. M., & Gupta, S. M. (2006). Ant colony optimization for disassembly sequencing with multiple objectives. The International Journal of Advanced Manufacturing Technology, 30(5), 481–496.
Article Google Scholar
McGovern, S. M., & Gupta, S. M. (2007). A balancing method and genetic algorithm for disassembly line balancing. European Journal of Operational Research, 179(3), 692–708.
Article Google Scholar
McGovern, S. M., & Gupta, S. M. (2011). The disassembly line: Balancing and modeling. New York: McGraw Hill.
Google Scholar
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097–1100.
Article Google Scholar
Sabuncuoglu, I., Erel, E., & Tanyer, M. (2000). Assembly line balancing using genetic algorithms. Journal of Intelligent Manufacturing, 11(3), 295–310.
Article Google Scholar
Scholl, A., Boysen, N., & Fliedner, M. (2008). The sequence-dependent assembly line balancing problem. OR Spectrum, 30(3), 579–609.
Article Google Scholar
Scholl, A., & Klein, R. (1999). Balancing assembly lines effectively: A computational comparison. European Journal of Operational Research, 114(1), 50–58.
Article Google Scholar
Sprecher, A. (1999). A competitive branch-and-bound algorithm for the simple assembly line balancing problem. International Journal of Production Research, 37(8), 1787–1816.
Article Google Scholar
Tonge, F. M. (1961). A heuristic program of assembly line balancing. Englewood Cliffs, NJ: Prentice Hall.
Tseng, H. E., Chen, M. H., Chang, C. C., & Wang, W. P. (2008). Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing. International Journal of Production Research, 46(21), 5951–5977.
Tuncel, E., Zeid, A., & Kamarthi, S. (2012). Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning. Journal of Intelligent Manufacturing, 2, 1–13.
Google Scholar
Wang, H.-F., & Gupta, S. M. (2011). Green supply chain management: Product life cycle approach. New York: McGraw Hill.
Google Scholar

Download references

Author information

Authors and Affiliations

Department of Industrial Engineering, Pamukkale University, Denizli , 20070, Turkey
Can B. Kalayci & Olcay Polat
Department of Mechanical and Industrial Engineering, Northeastern University, 360 Huntington Avenue, 334 SN, Boston, MA , 02115, USA
Surendra M. Gupta

Authors

Can B. Kalayci
View author publications
You can also search for this author in PubMed Google Scholar
Olcay Polat
View author publications
You can also search for this author in PubMed Google Scholar
Surendra M. Gupta
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Surendra M. Gupta.

Appendix

Arcus1

#	H	D	#	H	D	#	H	D	#	H	D	#	D
1	1	17	10	1	80	19	0	12	28	0	41	37	56
2	1	26	11	0	13	20	0	96	29	1	83	38	96
3	0	12	12	0	48	21	0	70	30	1	87	39	28
4	0	83	13	1	59	22	0	95	31	1	96	40	22
5	0	35	14	1	94	23	1	85	32	0	8	41	36
6	0	62	15	1	52	24	0	79	33	1	66	42	30
7	0	7	16	0	36	25	0	7	34	1	65	43	2
8	0	91	17	0	65	26	1	100	35	0	49	44	96
9	0	21	18	0	69	27	0	22	36	0	41	45	1

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
46	0	12	55	0	86	64	0	16	73	0	63	82	0	6
47	0	54	56	0	35	65	0	39	74	0	12	83	1	89
48	0	7	57	0	57	66	0	12	75	0	95
49	0	36	58	1	81	67	1	17	76	1	3
50	1	95	59	0	27	68	0	70	77	0	62
51	0	67	60	0	44	69	0	79	78	1	20
52	0	76	61	0	85	70	0	64	79	0	12
53	1	66	62	1	52	71	1	84	80	1	69
54	0	32	63	1	46	72	0	31	81	0	71

Arcus2

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	1	70	13	0	22	25	0	76	37	1	80	49	0	2
2	0	5	14	1	42	26	1	97	38	0	6	50	1	61
3	0	78	15	1	93	27	0	30	39	1	91	51	0	20
4	0	86	16	1	64	28	0	89	40	0	1	52	0	17
5	1	62	17	0	35	29	0	63	41	0	97	53	0	69
6	0	45	18	0	36	30	0	66	42	1	57	54	0	50
7	0	95	19	0	2	31	0	69	43	1	39	55	1	11
8	0	70	20	0	72	32	0	91	44	0	76	56	0	100
9	0	44	21	0	36	33	0	40	45	1	10	57	0	51
10	0	68	22	0	38	34	1	88	46	0	39	58	0	9
11	1	87	23	0	23	35	0	54	47	0	69	59	0	11
12	0	71	24	1	34	36	0	76	48	1	73	60	1	18

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
61	1	77	73	1	50	85	1	35	97	0	89	109	0	59
62	0	78	74	0	97	86	1	87	98	0	62	110	0	93
63	0	84	75	0	58	87	1	86	99	0	30	111	0	2
64	0	39	76	0	73	88	1	70	100	0	15
65	1	95	77	0	57	89	0	41	101	1	68
66	1	67	78	0	18	90	1	34	102	0	75
67	0	59	79	0	83	91	0	80	103	1	54
68	0	84	80	0	63	92	0	5	104	1	5
69	0	20	81	1	17	93	1	70	105	0	8
70	1	46	82	0	41	94	0	93	106	0	3
71	0	47	83	0	89	95	1	65	107	0	45
72	0	45	84	0	93	96	0	54	108	0	26

Barthol2

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	1	44	16	0	36	31	0	22	46	0	50	61	0	58
2	1	80	17	1	48	32	0	41	47	0	85	62	0	59
3	0	92	18	0	49	33	1	18	48	0	84	63	0	34
4	0	44	19	0	80	34	0	4	49	0	93	64	1	43
5	0	61	20	0	54	35	0	15	50	0	73	65	0	39
6	0	60	21	0	9	36	0	29	51	0	3	66	0	55
7	0	20	22	0	68	37	1	33	52	1	19	67	0	1
8	1	92	23	1	31	38	1	40	53	1	17	68	0	27
9	0	65	24	1	82	39	1	36	54	1	48	69	0	3
10	0	48	25	0	36	40	0	17	55	0	86	70	0	20
11	0	10	26	0	45	41	0	7	56	0	23	71	0	31
12	0	40	27	0	85	42	0	69	57	0	88	72	0	31
13	1	65	28	1	77	43	0	6	58	0	24	73	0	57
14	0	18	29	1	57	44	0	62	59	0	5	74	0	1
15	0	35	30	0	75	45	0	36	60	0	78	75	0	73

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
76	0	88	91	1	3	106	1	62	121	0	39	136	0	28
77	0	82	92	1	64	107	0	77	122	0	47	137	0	20
78	0	27	93	1	31	108	1	84	123	0	74	138	1	25
79	0	52	94	0	93	109	1	35	124	1	14	139	0	78
80	0	54	95	0	93	110	0	20	125	0	2	140	0	29
81	0	9	96	0	26	111	0	89	126	0	85	141	1	86
82	1	54	97	0	66	112	0	18	127	0	42	142	1	1
83	0	2	98	0	4	113	0	26	128	1	81	143	0	48
84	0	35	99	0	14	114	0	41	129	0	66	144	0	78
85	0	60	100	0	68	115	1	58	130	1	83	145	0	62
86	0	42	101	0	75	116	0	91	131	0	32	146	1	48
87	1	89	102	0	50	117	0	66	132	0	100	147	0	100
88	0	62	103	1	96	118	0	92	133	0	76	148	1	89
89	1	75	104	0	80	119	0	82	134	1	98
90	1	38	105	1	49	120	0	5	135	0	82

Bowman

#	H	D	#	H	D	#	H	D	#	H	D
1	0	25	2	1	53	3	1	86	4	0	88

#	H	D	#	H	D	#	H	D	#	H	D
5	1	66	6	0	19	7	1	34	8	0	73

Buxey

#	H	D	#	D	#	D	#	D	#	D
1	0	67	4	57	7	96	10	72	13	13
2	0	39	5	95	8	91	11	36	14	33
3	1	53	6	81	9	57	12	79	15	93

#	D	#	D	#	D	#	H	D	#	H	D
16	7	19	34	22	17	25	1	40	28	0	1
17	55	20	84	23	23	26	0	5	29	1	8
18	39	21	96	24	21	27	0	42

Gunther

#	D	#	H	D	#	D	#	D	#	H	D
1	88	5	0	48	9	6	13	45	17	0	23
2	95	6	0	80	10	19	14	95	18	0	48
3	45	7	1	99	11	3	15	82	19	1	82
4	25	8	1	31	12	1	16	90	20	0	62

#	H	D	#	H	D	#	D	#	H	D
21	0	93	25	0	35	29	57	33	0	68
22	0	69	26	1	97	30	34	34	1	29
23	0	86	27	1	12	31	64	35	0	67
24	1	88	28	1	74	32	61

Hahn

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	33	7	0	75	13	1	83	19	1	4	25	0	3
2	0	64	8	0	20	14	0	65	20	0	86	26	0	38
3	0	67	9	0	16	15	0	59	21	0	94	27	0	5
4	0	29	10	0	31	16	0	13	22	0	8	28	0	88
5	1	88	11	1	68	17	0	51	23	0	83	29	1	11
6	0	15	12	0	63	18	0	24	24	0	45	30	1	3

#	H	D	#	H	D	#	H	D	#	H	D
31	0	58	37	0	69	43	1	69	49	1	83
32	0	27	38	0	72	44	1	54	50	1	16
33	0	94	39	0	85	45	0	68	51	0	82
34	0	51	40	0	92	46	0	24	52	0	1
35	0	52	41	0	7	47	0	51	53	0	100
36	1	61	42	1	76	48	0	73

Heskiaoff

#	H	D	#	H	D	#	H	D	#	D	#	H	D
1	1	90	4	0	9	7	0	99	10	71	13	0	7
2	0	86	5	1	5	8	1	92	11	71	14	0	84
3	0	15	6	0	20	9	1	23	12	47	15	1	26

#	D	#	H	D	#	D	#	H	D	#	H	D
16	15	19	0	56	22	48	25	1	1	28	0	26
17	85	20	1	48	23	76	26	0	1
18	69	21	0	55	24	51	27	0	46

Jackson

#	H	D	#	H	D	#	H	D
1	0	35	3	0	56	5	1	30
2	0	30	4	0	74	6	1	40

#	H	D	#	H	D	#	H	D
7	0	90	9	0	19	11	0	44
8	1	84	10	1	80

Jaeschke

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	17	2	1	9	3	0	80	4	1	57	5	0	63

#	H	D	#	H	D	#	H	D	#	H	D
6	0	27	7	1	91	8	1	79	9	0	1

Kilbridge

#	H	D	#	H	D	#	H	D	#	D	#	D
1	0	39	6	1	88	11	0	97	16	14	21	22
2	1	37	7	0	75	12	1	78	17	45	22	36
3	0	89	8	0	73	13	0	73	18	96	23	78
4	0	78	9	0	98	14	0	21	19	3	24	37
5	0	78	10	0	76	15	0	5	20	64	25	64

#	H	D	#	H	D	#	H	D	#	H	D
26	0	51	31	0	82	36	1	34	41	0	9
27	0	21	32	1	25	37	1	18	42	0	34
28	0	97	33	1	40	38	0	2	43	0	98
29	1	11	34	1	12	39	0	41	44	1	27
30	0	46	35	0	97	40	0	1	45	0	2

Lutz1

#	H	D	#	D	#	H	D	#	D
1	1	36	5	60	9	0	4	13	69
2	0	42	6	65	10	0	52	14	59
3	1	78	7	8	11	1	2	15	20
4	0	32	8	23	12	1	58	16	28

#	H	D	#	H	D	#	H	D	#	H	D
17	0	63	21	1	35	25	0	47	29	0	88
18	0	29	22	0	3	26	1	98	30	0	43
19	0	92	23	0	26	27	0	53	31	1	65
20	1	8	24	0	31	28	0	60	32	0	38

Lutz2

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	7	10	0	72	19	1	10	28	0	64	37	0	42
2	0	43	11	0	41	20	0	92	29	0	22	38	0	55
3	0	18	12	0	81	21	0	62	30	0	100	39	0	13
4	0	64	13	0	47	22	1	70	31	1	54	40	0	72
5	0	7	14	0	25	23	0	79	32	1	97	41	0	27
6	0	19	15	1	47	24	0	3	33	0	18	42	1	33
7	0	12	16	1	51	25	0	2	34	0	18	43	1	44
8	0	65	17	0	36	26	0	97	35	0	66	44	0	93
9	1	69	18	1	49	27	0	54	36	0	97	45	1	72

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
46	0	51	55	1	38	64	1	4	73	0	81	82	0	100
47	1	60	56	0	6	65	0	92	74	0	13	83	0	89
48	0	73	57	0	35	66	0	8	75	0	2	84	1	13
49	0	59	58	0	91	67	0	39	76	0	48	85	1	90
50	0	68	59	0	74	68	0	5	77	0	46	86	0	13
51	0	50	60	1	62	69	0	61	78	0	11	87	0	47
52	0	15	61	1	35	70	0	42	79	0	98	88	1	79
53	0	18	62	0	73	71	0	9	80	1	29	89	0	48
54	0	47	63	0	78	72	1	45	81	0	46

Lutz3

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	60	10	0	90	19	0	78	28	0	24	37	1	3
2	0	91	11	1	50	20	0	47	29	0	10	38	0	66
3	0	16	12	1	9	21	0	53	30	1	12	39	1	36
4	0	69	13	0	2	22	0	23	31	0	39	40	0	63
5	0	94	14	0	11	23	0	29	32	0	48	41	0	5
6	0	84	15	0	68	24	0	76	33	0	2	42	0	28
7	0	29	16	0	55	25	0	66	34	1	41	43	1	25
8	1	63	17	0	48	26	1	99	35	0	69	44	0	26
9	1	34	18	0	100	27	0	30	36	0	99	45	0	98

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
46	0	90	55	1	38	64	0	94	73	0	16	82	0	2
47	1	78	56	0	93	65	0	64	74	0	52	83	0	2
48	0	20	57	0	30	66	0	77	75	1	30	84	0	1
49	0	33	58	1	64	67	0	24	76	0	28	85	0	83
50	0	24	59	1	24	68	0	28	77	1	72	86	0	95
51	1	99	60	0	4	69	0	73	78	0	16	87	0	37
52	0	29	61	1	66	70	1	49	79	0	15	88	0	57
53	1	28	62	0	26	71	0	19	80	0	65	89	1	86
54	1	44	63	0	96	72	1	57	81	0	71

Mansoor

#	H	D	#	H	D	#	H	D
1	1	14	3	0	50	5	0	54
2	1	75	4	0	50	6	1	2

#	H	D	#	H	D	#	H	D
7	0	20	9	0	47	11	0	32
8	1	98	10	0	45

Mertens

#	H	D	#	H	D	#	H	D	#	H	D
1	0	80	2	1	33	3	1	62	4	0	67

#	H	D	#	H	D	#	H	D
5	0	10	6	0	94	7	0	51

Mitchell

#	H	D	#	D	#	D	#	D
1	0	78	4	90	7	94	10	30
2	1	63	5	21	8	93	11	13
3	0	96	6	31	9	81	12	88

#	D	#	H	D	#	H	D
13	70	16	0	40	19	0	22
14	2	17	1	33	20	0	84
15	97	18	0	41	21	1	61

Mukherje

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	4	11	0	13	21	1	18	31	0	15	41	1	21
2	0	88	12	0	49	22	0	47	32	1	68	42	0	75
3	0	74	13	0	52	23	0	85	33	0	93	43	0	42
4	0	65	14	0	97	24	1	66	34	1	15	44	0	60
5	0	58	15	0	59	25	1	12	35	0	70	45	1	11
6	0	63	16	0	100	26	1	24	36	0	99	46	0	54
7	1	15	17	1	38	27	0	42	37	0	76	47	0	88
8	0	30	18	0	60	28	1	58	38	0	35	48	0	61
9	0	43	19	1	47	29	0	15	39	0	73	49	0	62
10	1	49	20	0	47	30	1	69	40	1	16	50	0	6

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
51	1	84	61	1	47	71	1	43	81	1	7	91	1	79
52	0	96	62	0	3	72	0	36	82	0	83	92	1	75
53	0	6	63	0	88	73	1	56	83	0	61	93	1	57
54	1	92	64	0	28	74	1	60	84	0	69	94	0	42
55	0	85	65	0	80	75	0	69	85	0	10
56	0	75	66	1	74	76	1	38	86	1	73
57	0	70	67	0	16	77	0	28	87	0	20
58	0	96	68	1	90	78	1	22	88	0	27
59	0	92	69	1	45	79	0	25	89	0	97
60	1	63	70	0	99	80	0	66	90	0	19

Roszieg

#	D	#	H	D	#	D	#	H	D	#	D
1	29	4	0	86	7	29	10	1	14	13	57
2	69	5	0	47	8	70	11	0	85	14	6
3	23	6	1	51	9	74	12	1	34	15	64

#	H	D	#	D	#	H	D	#	H	D
16	0	100	19	66	22	0	84	25	0	59
17	1	87	20	66	23	1	86
18	0	61	21	93	24	0	49

Tonge

#	H	D	#	D	#	H	D	#	H	D	#	H	D
1	1	21	8	16	15	0	8	22	0	5	29	1	85
2	1	50	9	98	16	0	29	23	0	28	30	1	84
3	0	25	10	46	17	0	84	24	0	50	31	0	40
4	0	46	11	22	18	0	91	25	1	58	32	1	82
5	0	35	12	88	19	0	2	26	0	46	33	0	84
6	0	29	13	6	20	1	43	27	0	20	34	0	31
7	0	81	14	2	21	0	2	28	0	45	35	0	4

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
36	1	46	43	0	80	50	0	98	57	0	84	64	1	30
37	0	93	44	0	29	51	0	86	58	0	21	65	0	22
38	0	13	45	0	24	52	0	27	59	0	21	66	0	63
39	0	1	46	1	95	53	1	58	60	0	17	67	0	77
40	0	64	47	0	94	54	1	20	61	0	85	68	1	70
41	0	44	48	0	39	55	1	23	62	0	100	69	1	33
42	0	47	49	0	4	56	0	3	63	1	56	70	1	25

Wee-mag

#	H	D	#	H	D	#	H	D	#	H	D	#	H	D
1	0	32	9	0	68	17	1	32	25	0	78	33	0	57
2	0	92	10	0	32	18	0	21	26	1	80	34	1	15
3	0	64	11	1	12	19	0	60	27	0	42	35	1	15
4	1	64	12	0	12	20	0	39	28	0	16	36	0	13
5	0	83	13	0	100	21	0	73	29	0	36	37	0	82
6	0	50	14	0	10	22	1	16	30	0	40	38	1	69
7	1	86	15	0	10	23	0	3	31	0	80	39	0	76
8	0	92	16	1	51	24	0	42	32	0	61	40	0	67

#	D	#	H	D	#	H	D	#	H	D	#	H	D
41	50	49	0	99	57	1	56	65	0	91	73	0	89
42	59	50	1	6	58	0	63	66	1	93	74	0	46
43	16	51	0	100	59	0	29	67	1	67	75	0	37
44	91	52	0	10	60	0	43	68	0	33
45	88	53	0	12	61	0	40	69	0	46
46	29	54	0	27	62	0	44	70	1	88
47	67	55	0	69	63	0	5	71	0	73
48	31	56	0	68	64	0	72	72	0	68

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalayci, C.B., Polat, O. & Gupta, S.M. A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. Ann Oper Res 242, 321–354 (2016). https://doi.org/10.1007/s10479-014-1641-3

Download citation

Published: 19 June 2014
Issue Date: July 2016
DOI: https://doi.org/10.1007/s10479-014-1641-3

Keywords

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

Abstract

Access this article

Similar content being viewed by others

A Problem Specific Genetic Algorithm for Disassembly Planning and Scheduling Considering Process Plan Flexibility and Parallel Operations

A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time

Hybrid evolutionary algorithm for stochastic multiobjective disassembly line balancing problem in remanufacturing

References

Author information

Authors and Affiliations

Corresponding author

Appendix

Rights and permissions

About this article

Cite this article

Keywords

Navigation

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

Abstract

Access this article

Similar content being viewed by others

A Problem Specific Genetic Algorithm for Disassembly Planning and Scheduling Considering Process Plan Flexibility and Parallel Operations

A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time

Hybrid evolutionary algorithm for stochastic multiobjective disassembly line balancing problem in remanufacturing

References

Author information

Authors and Affiliations

Corresponding author

Appendix

Appendix

Rights and permissions

About this article

Cite this article

Share this article

Keywords

Search

Navigation