| Article ID: | iaor1994613 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 9 |
| Start Page Number: | 2171 |
| End Page Number: | 2177 |
| Publication Date: | Sep 1993 |
| Journal: | International Journal of Production Research |
| Authors: | Chan D. |
| Keywords: | programming: travelling salesman |
The travelling salesman problem formulation is extended to allow precedence constraints between cities. A method is proposed for finding good inexpensive solutions to this problem with results illustrated by several scheduling applications: circuit board assembly, courier routeing and the no wait flowshop scheduling problem.