electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and ‎tardiness‎

‎in this paper, we study a flow shop batch processing machines scheduling problem. the fuzzy due dates are considered to make the problem more close to the reality. the objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. in order to tackle the given problem, we propose a hybrid electromagnetism-like (em) algorithm, in which the em is hybridized with a diversification mechanism and effective local search to enhance the efficiency of the algorithm. the proposed algorithms are evaluated by comparison against two existing well-known ems in the literature. additionally, we propose some heuristics based on the earliest due date (edd) to solve the given problem. the  proposed hybrid em algorithm is tested on sets of various randomly generated instances. for this purpose, we investigate the impacts of the rise in problem sizes on the performance of the developed algorithm. through the analysis of the experimental results, the highly effective performance of the proposed algorithm is shown against the two existing well-known ems from the literature and proposed ‎edds.‎