A NO-WAIT FLOW SHOP SCHEDULING WITH TOTAL STRETCH MINIMIZATION

초록

A hybrid genetic algorithm (HGA) is proposed to minimize total stretch in a no-wait flow shop scheduling problem. The stretch of a job is the flow time of the job divided by its processing time. HGA combines local search with genetic algorithm (GA) to reduce the possibility of premature convergence. The performance of HGA is compared with that of GA and the experimental results show that HGA works well for this type of problem. © 2022 ICIC International. All rights reserved.

키워드