The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.
Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy