We study a max-min fair minimum cost task allocation problem in transportation. We propose polynomial-time algorithms to solve the problem to optimality. We conduct experiments to investigate the trade-off between cost and fairness. Experimental results show in many cases considering fairness is beneficial.