Precedence constrained TSP applied to circuit board assembly and no wait flowshop
将旅行商问题扩展为带优先约束的版本，提出求解方法，并应用于电路板组装、快递路线和无等待流水车间调度问题。
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.