In this paper we further investigate the problem of finding nadir criterion values (minimum criterion values over the nondominated set) in multiple objective linear programming. Although easy to ...

In this paper, we propose a generic approach to find compromise solutions for multiple-objective scheduling problems using metaheuristics. As an illustration, we present a new hybrid tabu ...