Exact and hybrid metaheuristic algorithms to solve bi-objective permutation flow shop scheduling problem
HM Motair - Journal of Physics: Conference Series, 2021 - iopscience.iop.org
In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-
objective of minimizing the makespan (C max) and maximum tardiness (T max). The aim is …
objective of minimizing the makespan (C max) and maximum tardiness (T max). The aim is …