Hydride Flow Shop To Minimize Makespan and Maximize Tardiness by using Taguchi Optimum Design Process

The scheduling problem in hybrid flowshops that consist of multi stages in series, each of which has multiple identical and unidentical parallel machines is considered. Here the setup times are sequence dependent and the objective is to minimize makespan and maximum tardiness. To solve such an NP-hard problem, a simulated annealing (SA) algorithm is introduced. The SA (HSA) algorithm is hybridized with a simple local search to the improve the quality of final solution of the SA algorithm. Taguchi method is employed as an optimization technique to extensively tune different parameters and operators of our algorithm. Taguchi orthogonal array analysis is the best parameters for the optimum design process with the least number of experiments, is established a benchmark to draw an analogy between the performance of SA with other algorithms. The objective functions of the minimization of makespan and maximum tardiness are taken into consideration to evaluate the robustness and effectiveness of the HSA. The effects of the increase in the number of jobs on the performance of the algorithm are explored to make sure it is effective in terms of both the acceptability of the solution quality and robustness. The excellency and strength of the HSA are concluded from all the results acquired in various circumstances.