Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem

This note examines the mathematical structure and applicability of a dominance condition of Gupta and Reddi for the three-machine flow-shop problem. It shows that this condition may eliminate fewer sequences than another dominance condition. A sequential procedure of the combined strength of the two conditions is presented. We also derive necessary conditions for the Gupta-Reddi condition.