Title of article
Approximate Solution for Two Machine Flow Shop Scheduling Problem to Minimize the Total Earliness
Author/Authors
Abdullah, H. F. University of Baghdad - Ibn-Al-Haitham College of Education - Department of Mathematics, Iraq
From page
325
To page
332
Abstract
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.
Keywords
Flow , shops scheduling , approximate solution , two machine flow , shop , minize the total earliness , scheduling problem.
Journal title
Ibn Alhaitham Journal For Pure and Applied Science
Journal title
Ibn Alhaitham Journal For Pure and Applied Science
Record number
2602089
Link To Document