Weak and strong machine dominance in a nonpreemtive flowshop

Abstrakt

In this paper we study a special case of flowshop defined by additional machine dominance constraints. The main result of this paper shows that the flowshop problem with a dominant machine can be solved in polynomial time for a broad class of objective functions.