This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.