Kai Zhou GaoPonnuthurai Nagaratnam SuganthanQuan Ke PanMehmet Fatih Tasgetiren2025-10-0620150020-75431366-588X10.1080/00207543.2015.1020174http://dx.doi.org/10.1080/00207543.2015.1020174https://gcris.yasar.edu.tr/handle/123456789/7593This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP with fuzzy processing time. The objective is to minimise maximum fuzzy completion time. A simple and effective heuristic rule is proposed to initialise harmony population. Extensive computational experiments are carried out using five benchmark cases with eight instances from remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases. The proposed DHS algorithm is compared to six metaheuristics. The results and comparisons show the effectiveness and efficiency of DHS for solving FJSP with fuzzy processing time.Englishdiscrete harmony search, flexible job shop scheduling, fuzzy processing time, fuzzy completion time, remanufacturingGENETIC ALGORITHM, OPTIMIZATION ALGORITHM, FLOW-SHOP, COLONYArticle