Abstract

There are a lot of scheduling problems that have a combinatorial manner and these problems are difficult to be solved. For these scheduling problems , local search methods are used to find the optimal solution or near optimal solutions.In this paper we consider the scheduling problem on two machine flow Shop to find the minimum maximum completion time and maximum of tardiness to be compared with some of the local search methods namely (Descent method (DM), Adjacent parwise interchange method(APIM) and Simulated annealing method (SAM) . We developed the Genetic Algorithm (GA)) by using a large number of experimental problems, we proposed a new heuristic method (NHM) and when comparing the results of this method with the preceding methods we found that it is the best in case of qualification

The article was added to IASJ on 2015-02-15

219 Total full text downloads since the date of addition