Weak and Strong Machine Dominance in a Nonpreemptive Flowshop

Abstrakt

The paper shows how to obtain polynomial time optimization algorithms for a broad class of objective functions in a nonpreemtive flowshop with additional constraints on feasible operation lengths (so called machine dominance).