A TSF (1,2) application arising in cable assembly shops

Journal of the Operational Research Society

Volumn 56, Issue 6, 2005, Pages 642-648

  Duman, E ^a   Ozcelik, M H ^b   Ceranoglu, A N ^a  

^a DOGUS UNIVERSITY   (Turkey)

^b Yapi ve Kredi Bankasi   (Turkey)

Author keywords

Cable assembly; Heuristics; TSP (1,2)

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMOTIVE INDUSTRY; CUTTING; HEURISTIC METHODS; PROBLEM SOLVING;

CABLE ASSEMBLY; OPTIMUM 2-MATCHING PROBLEM; PEARSON CORRELATION COEFFICIENT; TSP (1,2);

CABLES;

EID: 18944365136     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601850     Document Type: Article

References (7)

1. Fotakis D and Spirakis P (1998). A Hamiltonian approach to the assignment of non-reusable frequencies. In: Arvind V and Ramanujam R (eds). Proceedings of the Eighteenth Conference on the Foundations of Software Technology and Theoretical Computer Science, Chennai, India. Springer: Berlin, pp 18-29.
2. Lawler EL et al (1987). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons: New York.
3. Glover F and Punnen AP (1997). The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J Opt Res Soc 48: 502-510.
4. Bozer Y A, Shorn EC and Sharp OP (1990). Geometric approaches to solve Chebyshev traveling salesman problem. IIE Trans 22: 238-254.
5. Karp RM (1972). Reducibility among combinatorial problems. In: Raymond EM and James WT (eds). Complexity of Computer Computations. Plenum Press, New York, pp 85-103.
6. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco.
7. Papadimitriou CH and Yannakakis M (1993). The traveling salesman problem with distances one and two. Math Opns Res 18: 1-11.