Solving the bi-objective personnel assignment problem using particle swarm optimization

► The novel particle swarm optimization with random-key encoding to solve bi-objective personnel assignment problem. ► To swap between RK virtual space and candidate order of BOPAP using PSORK algorithm. ► To implement the linear-type of the time-varying coefficients ω, K1, and K2 for BOPAP. ► The solution quality of BOPAP of the proposed method is far better than those of the f1_f2 heuristic algorithm.