Greedy simulated annealing algorithm for solving hybrid flow shop scheduling problem with re-entrant batch processing machine

In the production process of seamless steel tube, it has obvious reentry characteristics, in which the process needs multiple reentries. This paper models the scheduling problem of the seamless steel tube as the hybrid flow shop scheduling problem with re-entrant jobs and batch processing machines. Firstly, a model is formulated. Second, a greedy simulated annealing algorithm is proposed. The global searching ability is enhanced by accepting sub-optimal solutions with probability, and the local greedy searching is integrated to local search the non-dominant solution. Finally, numerical experiments are carried out and the results show that the proposed algorithm can solve the hybrid flow shop scheduling problem with re-entrant jobs and batch processing machines effectively.