Benchmark data set for evaluation of line balancing algorithms

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 5, Issue PART 1, 2007, Pages 48-53

  McGovern, Seamus M ^a   Gupta, Surendra M ^b  

^a US DOT National Transportation Systems Center   (United States)

^b Northeastern University   (United States)

Author keywords

Algorithms; Benchmark examples; Combinatorial mathematics; Data sets; Heuristics; Manufacturing

Indexed keywords

COMBINATORIAL MATHEMATICS; MANUFACTURE;

ASSEMBLY LINE BALANCING PROBLEMS; BIN PACKING PROBLEM; DATA SETS; DISASSEMBLY LINE BALANCING; EVALUATION AND ANALYSIS; HEURISTICS; LINE BALANCING; OPTIMAL SOLUTIONS;

ALGORITHMS;

EID: 79961038399     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20070523-3-es-4907.00009     Document Type: Conference Paper

References (18)

1. Brennan, L., S.M. Gupta and K.N. Taleb (1994). Operations planning issues in an assembly/disassembly environment. International journal of operations and production planning, 14, 57- 67.
2. Garey, M. and D. Johnson (1979). Computers and intractability: a guide to the theory of NP completeness. W.H. Freeman, San Francisco, CA.
3. Gungor, A. and S.M. Gupta (1999a). Disassembly line balancing. Proceedings of the 1999 annual meeting of the Northeast Decision Sciences Institute, 193-195.
4. Gungor, A. and S.M. Gupta (1999b). A systematic solution approach to the disassembly line balancing problem. Proceedings of the 25th international conference on computers and industrial engineering, 70-73.
5. Gungor, A. and S.M. Gupta (2001). A solution approach to the disassembly line problem in the presence of task failures. International journal of production research, 39, 1427-1467. (Pubitemid 35165625)
6. Gungor, A. and S.M. Gupta (2002). Disassembly line in product recovery. International journal of production research, 40, 2569-2589. (Pubitemid 34808265)
7. Gupta, S.M. and K.N. Taleb (1994). Scheduling disassembly. International journal of production research, 32, 1857-1866.
8. Lambert, A.J.D. and S.M. Gupta (2005). Disassembly modeling for assembly, maintenance, reuse, and recycling. CRC Press, Boca Raton, FL.
9. McGovern, S.M. and S.M. Gupta (2004). Metaheuristic technique for the disassembly line balancing problem. Proceedings of the 2004 Northeast Decision Sciences Institute conference, 223-225.
10. McGovern, S.M. and S.M. Gupta (2005). Local search heuristics and greedy algorithm for balancing the disassembly line. The international journal of operations and quantitative management, 11, 91-114. (Pubitemid 41553853)
11. McGovern, S.M. and S.M. Gupta (2006a). Ant colony optimization for disassembly sequencing with multiple objectives. The international journal of advanced manufacturing technology, 30, 481-496. (Pubitemid 44370984)
12. McGovern, S.M. and S.M. Gupta (2006b). Computational complexity of a reverse manufacturing line. Proceedings of the 2006 SPIE international conference on ECM VI, CDROM.
13. McGovern, S.M. and S.M. Gupta (2006c). Deterministic hybrid and stochastic combinatorial optimization treatments of an electronic product disassembly line. In: Applications of management science, volume 12 (Lawrence, K.D. and R.K. Klimberg. (Eds)), 175-197. Elsevier, New Holland, Amsterdam.
14. McGovern, S.M. and S.M. Gupta (2007). A balancing method and genetic algorithm for disassembly line balancing. European journal of operational research, 179, 692-708. (Pubitemid 46038584)
15. Miller, I. and J.E. Freund (1985). Probability and statistics for engineers. Prentice Hall, Englewood Cliffs, NJ.
16. Papadimitriou, C.H. and K. Steiglitz (1998). Combinatorial optimization: algorithms and complexity. Dover, Mineola, NY.
17. Torres, F., P. Gil, S.T. Puente, J. Pomares and R. Aracil (2004). Automatic PC disassembly for component recovery, " International journal of advanced manufacturing technology, 23, 39-46.
18. Tovey, C.A. (2002). Tutorial on computational complexity. Interfaces, 32, 30-61.