Abstract
This paper considers two- and three-machine flow-shop makespan scheduling problems with additional times separated from processing times. For two-machine case we investigate the optimality of the passing of jobs and give an optimal algorithm in permutation case with five independent times, that is, setup and removal times, start and stop lags and transportation times. It generalizes known algorithms. And for a three-machine case with independent setup times alone, we present several sufficient optimality conditions for a specified sequence ω_1 and clarify not only their mutual relation but also the superiority of ω_1 as an approximate sequence. Those results generalize the results in usual three-machine flow-shop case.
