Precedence constrained TSP applied to circuit board assembly and no wait flowshop

References

• BOYD , S. C. , PULLEYBLANK , W. R. ,CORNUtJOLS, C, 1987 , TRAVEL—an interactive travelling salesman problem package for IBM-personal computer . Operations Research Letters, 6 ( 3 ), 141 – 143 .
   Google Scholar
• CHAN , D. and MERCIER , D. , 1989 , IC chip insertion an application of the travelling salesmanproblsm . International Journal of Production Research, 27 ( 10 ), 1837 – 1841 .
   Web of Science ®Google Scholar
• GAREY , M. R. and JOHNSON , D. S. , 1979 , Computers and Intractability A Guide to the Theory of NP-Completeness ( New York Freeman ).
   Google Scholar
• KANELLAKIS , P. C. and PAPADIMITRIOU , C. H. , 1980 , Operations Research, 28 ( 5 ), 1086 – 1099 .
   Google Scholar
• LAWLER , E. L. , LENSTRA , J. K. , RINNOOY KAN , A. H. and SHMOYS , D. B. , 1985 , The Travelling Salesman Problem A Guided Tour of Combinatorial Optimization ( NewYork Wiley ).
   Google Scholar
• LIN , S. ,KERNIGHAN, B,, 1973 , An effective heuristic for the travelling salesman problem . Operations Research, 21 , 498 – 516 .
   Web of Science ®Google Scholar
• MILLER , D. L. and PEKNY , J. F. , 1991 , Exact solution of large asymmetric travelling salesman problems . Science, 251 , 754 – 760 .
   PubMedGoogle Scholar
• NEW YORK TIMES, 1991 , Science section , March 11 .
   Google Scholar
• PAPADIMITRIOU , C. H. ,KANELLAKIS, P. C, 1980 , Flowshop scheduling with limited storage . Journal of the Association for Computing Machinery, 27 ( 3 ), 533 – 549 .
   Web of Science ®Google Scholar
• PADBERG , M. W. and RINALDI , G. , 1991 , A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems . Siam Review, 33 ( 1 ), 60 – 100 .
   Web of Science ®Google Scholar