Flow-shops with a dominant machine

Flow-shop problems with a dominant machine are introduced. The authors show that for these kinds of problems they can restrict the present search for an optimal schedule to permutation schedules if the optimality criterion is regular. Furthermore, the authors give an expression for the completion times with respect to a semi-active permutation schedule and they give fast algorithms for the weighted completion times and the maximal lateness criterion.