We consider in this paper an integrated scheduling and vehicle routing problem: jobs have to be produced and then transported to a customer place for a given due date. The manufacturing workshop is a flow shop and there is only one vehicle available. We are interested in the minimization of the total tardiness, related to the delivery completion times. Therefore, we are faced to three interdependent problems: scheduling the jobs in the flow shop environment, batching the completed jobs, and routing the batches. We propose two tabu search algorithms and a matheuristic algorithm. Computational experiments are performed on random data sets and show the efficiency of the methods.