Approximate Solution for Two Machine Flow Shop Scheduling Problem to Minimize the Total Earliness
Flow-shops scheduling
approximate solution
two machine flow-shop
minize the total earliness
scheduling problem.
This paper proposes a new algorithm (F2SE) and algorithm (Alg(n – 1)) for solving the
two-machine flow shop problem with the objective of minimizing total earliness. This
complexity result leads us to use an enumeration solution approach for the algorithm (F2SE)
and (DM) is more effective than algorithm Alg( n – 1) to obtain approximate solution.