Zvi Drezner, The p-Centre Problem-Heuristic and Optimal Algorithms, The Journal of the Operational Research Society, Vol. 35, No. 8 (Aug., 1984), pp. 741-748 ...

This paper focuses on a production planning problem in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problem, that is, tardiness is not allowed.

For the routing, we have utilized a heuristic search algorithm which first, generates a number of full routing paths. For example it generates 500 full routing paths.