1. J. Christopher Beck, Patrick Prosser, and Evgeny Selensky. On the reformulation of vehicle routing problems and scheduling problems. Technical Report APES-44-2002, APES Research Group, February 2002. Available from
http://www.dcs.st-and.ac.uk/apes/apesreports.html
.
2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
3. Evgeny Selensky. On mutual reformulation of shop scheduling and vehicle routing. In Proceedings of the 20th UK PLANSIG, pages 282–291, 2001.
4. M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254–365, 1987.
5. Jssp benchmarks, 15 by 15.
http://www.dcs.gla.ac.uk/pras/resources.html
.