Optimal four-machine flow shop scheduling with dominance condition

Abstract

In this research we extend the Johnson’s scheduling rule into the four stage production schedule problem. The algorithm proposed is based on Johnson’s three stage scheduling algorithm with restriction of dominance. With proof of the theorem, a decision rule is obtained for the optimal scheduling of four stage production problem with dominance restriction.

Keywords:

• Flow shop
• scheduling algorithm
• optimal solution