The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Algorithm 1

Global_Adjustment_Algorithm.

(1) For each operation

(2)  Compute and .

(3)  If   then

(4)    Let the set of successors of operation .

(5)    For  

(6)     If   then .

(7)     If   then the instance is infeasible.

(8)    end (For)

(9)  end (If)

(10)   If   then

(11)    Let   the set of predecessors of operation

(12)    For  

(13)      If   then .

(14)       If   then the instance is infeasible.

(15)    end (For)

(16)   end (If)

(17) end (For)

(18) If for all operations we have and then STOP. Otherwise, set ; and go to line (1).