Technical Note—Precedence Relations of the Flow-Shop Problem

A theory based on the precedence relation (dominance condition with no fixed presequence) concept has been developed and applied to the flow-shop problem. The nature and scope of two major precedence relations have been explored. The paper offers a natural generalization of the Johnson algorithm for the general case, and proves sufficient conditions for optimality of the resulting sequence.