Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated

This report proposes a solution to the open shop scheduling problem with the objective of minimizing total job tardiness in the system. Some practical processing restrictions, such as independent Setup and dependent removal times, are taken into account as well. The addressed problem is first described as a 0-1 integer programming model, and is then solved optimally. Subsequently, some hybrid genetic-based heuristics are proposed to solve the problem in an acceptable computation time. To demonstrate the adaptability of these heuristics, some performance comparisons are made with Solutions provided by running either a mathematical programming model or certain classic meta-heuristics such as genetic algorithm. simulated annealing. and tabu search in various manufacturing scenarios. The experimental results show that the hybrid genetic-based heuristics perform well, especially the DGA. However, these heuristics require some more additional computations but are still acceptable. (c) 2008 Published by Elsevier Ltd.