Explain how the Travelling Salesman problem is equivalent to a Permutational Flow Shop problem. If possible, please also provide calculations to go along with the explanations.
Use the following reference:
Solvable Cases of the No-Wait Flow-Shop Scheduling Problem
Author(s): Jack A. A. Van der Veen and Rene van Dal Source: The Journal of the Operational Research Society, Vol. 42, No. 11 (Nov., 1991), pp. 971- 980
Travelling Salesman Problem
Question: Explain how the Travelling Salesman problem is equivalent to a Permutational Flow Shop problem. Use the following reference:
First, the travelling salesman problem (TSP) pertains to the solution that results to the shortest possible route given a list of several cities and that each city is visited once where the start and end cities of the entire route are both the origin city. Furthermore, this ...
This solution discusses the travelling salesman problem and a permutational flow shop problem. The explanation is given in 384 words and calculations.