LAUSR

Abstract The problem of minimising total absolute deviation of job completion times in a two-machine no-wait proportionate flow shop has been recently studied. It was shown that the LPT (largest processing time first) job sequence is optimal if the number of jobs n does not exceed 7, and that the LPT sequence is not optimal for instances with . We prove that there exists an optimal semi-V-shaped job sequence, in which the first job has the largest processing time, a certain number, greater than n / 2, of the following jobs appear in the LPT order, and jobs following job with the minimum processing time are sequenced in the SPT (shortest processing time first) order. We also present an time dynamic programming algorithm to find the best V-shaped job sequence, in which the jobs on the left of the job with the minimum processing time are sequenced in the LPT order and those on the right of this job are sequenced in the SPT order.