1. The Wilson model, which is given in Section 2.3 of Article 3 (Tseng et al., 2004) for solving the permutation flowshop makespan minimization problem, is based on the decision variable defining the start (begin) time of the job in a sequence position on a machine. Assume that there is a unit independent (detached) setup time before processing a job on a machine, and the objective to be minimized is the total tardiness, not the meakespan. Defining additional parameters and decision variables, transform the Wilson's model into a model, which is based on the decision variable defining the completion time of the job in a sequence position on a machine