Nonpreemptive flowshop scheduling with machine dominance

Abstract

In this paper we study special cases of flowshop defined by additional machine dominance constraints. These constraints impose certain relations among the job processing times on different machines and make the studied problems tractable.