We study a variation of the facility location problem that involves finding ideal locations for capacitated facilities and assigning agents to these facilities. Additionally, each agent has an ordinal ranking over the facilities and incurs a cost related to both the ranking and the distance from their assigned facility. Our work focuses on minimizing the maximum cost and total cost. For these objectives, we show that computing an optimal solution is intractable in general, but we provide exact algorithms that run in polynomial time when the number of facilities is constant. We then move to the mechanism design setting, where the agents’ preferences are private information, and design strategy-proof mechanisms which have a bounded approximation for our objectives.