Bi-criteria bottleneck assignment problem

In this paper, a bi-criteria bottleneck assignment problem with suitability of workers for jobs and ranked preference of jobs for workers is considered. This model has two objectives, namely: maximize the minimum suitability among all jobs and minimize the maximum rank among all workers. In other words, the bi-criteria problem is formulated from the viewpoint of not only decision maker but also workers. To solve this problem, we propose an efficient algorithm that finds non-dominated solutions. Further, the time complexity of the proposed algorithm is discussed. Finally, the applicability of the proposed algorithm is illustrated by a numerical example.