Abstract
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.