No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem

Marcin Mucha, Maxim Sviridenko

In this paper we study the classical no-wait flowshop scheduling problem with makespan objective (F|no-wait|C_max in the standard three-field notation). This problem is well-known…