Travelling salesman problem-permutational flow shop problem


Travelling salesman problem:

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

Solution Preview :

Prepared by a verified Expert
Other Management: Travelling salesman problem-permutational flow shop problem
Reference No:- TGS01438808

Now Priced at $25 (50% Discount)

Recommended (96%)

Rated (4.8/5)