Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem

This paper focuses on solving the bi-objective problem of no-wait two-stage flexible flow shopscheduling. the objectives considered in this study are minimum makespan (cmax), as well as maximumtardiness of jobs (tmax). this problem is known as np-hard. hence, three bi-objective optimizationmethods based on simulated annealing, called cwsa (classical weighted simulated annealing), nwsa(normalized weighted simulated annealing), and fsa (fuzzy simulated annealing), are developed to solvethe problem with the goal of finding approximations of the optimal pareto front. due to the fact thatmeta-heuristic algorithms are very vigilant of parameter values, we proposed a new reliable method, bymixing the taguchi method and a multi-objective decision making (modm) approach, for achieving ourpurpose. the algorithms are evaluated by solving both small and large scale problems. the performancesare evaluated in terms of a relative deviation index. finally, the result of the study is discussed andconcluded, and potential areas of further study are highlighted.