my question is about shceduling prblems from sheduling theory,algorithms and systems by M.Pinedo. Show that 1 | sjk | Cmax is equivalent to the following Travelling Salesman Problem: A travelling salesman starts out from city 0, visits cities 1, 2, . . . , n and returns to city 0, while minimizing the total distance travelled. The distance from city 0 to city k is s0k; the distance from city j to city k is sjk and the distance from city j to city 0 is sj0.