A HYBRID SIMULATED ANNEALING TO MINIMIZE MAXIMUM COMPLETION TIME IN A PROPORTIONATE FLOW SHOP

초록

A proportionate flow shop is a special case of flow shops where the processing times of a job are the same on all machines. In this paper, a hybrid simulated annealing (HSA) is proposed for an n-job m-machine proportionate flow shop scheduling problem with one machine of different speeds, in which the objective is to minimize the maximum completion time. HSA is a hybrid approach, which utilizes search diversification of genetic algorithm and search intensification of simulated annealing. Computational tests on randomly generated problems are conducted to evaluate the performance of the HSA. © 2022 ICIC International. All rights reserved.

키워드