Operations sequencing in a cable assembly shop

Proceedings of the 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005

Volumn , Issue , 2005, Pages 411-416

  Ceranoglu, Ahmet N ^a   Duman, Ekrem ^a   Hamdi Ozcelik, M ^b  

^a DOGUS UNIVERSITY   (Turkey)

^b Yapi Kredi Bankasi ^*  (Turkey)

Author keywords

Cable assembly; Heuristics; TSP(1 2)

Indexed keywords

CABLE ASSEMBLIES; CABLE SYSTEMS; HEURISTICS; OPERATIONS SEQUENCING; OPTIMUM SOLUTION; SET-UP TIME; TSP(1 2);

AUTOMOTIVE INDUSTRY; HEURISTIC ALGORITHMS; INDUSTRIAL ENGINEERING;

CABLES;

EID: 84878824081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Fotakis, D. & Spirakis, P. (1998), A Hamiltonian Approach to the Assignment of Non-Reusable Frequencies. Proceedings of the Eighteenth Conference on the Foundations of Software Technology and Theoretical Computer Science. Chennai, India, pp 18-29.
2. Papadimitriou CH and Yannakakis M (1993), The traveling salesman problem with distances one and two. Mathematics of Operations Research 18: 1-11.
3. Duman, E., Ozcelik, M.H., & Ceranoglu, A.N., (2005) A TSP (1, 2) Application Arising in Cable Assembly Shops. Journal of the Operational Research Society, (to appear).