Scheduling Unit Tasks with Collective Preferences: Computational Social Choice Meets Scheduling

Given a set of tasks and a set of voters with preferences over the order of task execution, the goal is to compute a consensus schedule that minimizes the average dissatisfaction of the voters.