We present the Pareto Late Acceptance Hill Climbing algorithm, a multi-objective optimization algorithm based on the Late Acceptance Hill Climbing. We propose an initial experimental analysis of its behavior applying it to different formulations of the bi-objective Permutation Flowshop Scheduling Problem.
