问将任务分配给人的算法，其中有些任务需要多个人，而且没有人两次执行相同的任务。

EN

0 "Attendance": 1,
1 "Table Captain": 4,
2 "Teacher's Helper": 2,
3 "Board Eraser": 2,
4 "Light Switcher": 1,
5 "Librarian": 2,
6 "Lunch Helper": 1,
7 "Equipment Manager": 3,
8 "Trash Monitor": 2,
9 "Tech Specialist": 1,
# "Paper Passer": 3,
$ "Pencil Sharpener": 1

 job    0 1 1 1 1 2 2 3 3 4 5 5 6 7 7 7 8 8 9 # # # $
week 1  a b c d e f g h i j k l m n o p q r s t u v w
week 2  t u v w a b c d e f g h i j k l m n o p q r s
week 3  p q r s t u v w a b c d e f g h i j k l m n o

 job    0 # 1 1 1 1 2 5 3 4 7 2 8 5 6 7 3 7 # 8 9 # $
week 1  a b c d e f g h i j k l m n o p q r s t u v w
week 2  t u v w a b c d e f g h i j k l m n o p q r s
week 3  p q r s t u v w a b c d e f g h i j k l m n o

sort all persons into a list P; random is fine       
   persons in P have an initially empty list of tasks that they have carried out
sort all tasks into a list T; random is fine
generate a valid assignment as follows:
   for each task Ti in T,
       for t = Ti (the number of people required to staff the i-th task), and t>0
           for each person Pj in P, starting from the last-assigned person,
               if Pj has never performed Ti, and has no task for the current day,
                   add Ti to Pj's tasks, and decrement t
               otherwise, skip Pj; if everybody is so skipped, then exit

// initialize tasks            
let tasks = new Map([
    ["Attendance", 1],
    ["Table Captain", 4],
    ["Teacher's Helper", 2],
    ["Board Eraser", 2],
    ["Light Switcher", 1],
    ["Librarian", 2],
    ["Lunch Helper", 1],
    ["Equipment Manager", 3],
    ["Trash Monitor", 2],
    ["Tech Specialist", 1],
    ["Paper Passer", 3],
    ["Pencil Sharpener", 1]
]);

// initialize people by counting total hands for all tasks
let totalPeople = 0;
for (let p of tasks.values()) totalPeople += p;
// and give each person an empty list of tasks for each assignment
let people = Array.apply(null, Array(totalPeople)).map(() => new Array());

function assign(tasks, people) {
    let moreAssignmentsMayBePossible = true;
    let assignments = 0;
    outer: while (moreAssignmentsMayBePossible) {
        let nextIndex = 0;
        for (let t of tasks) {
            let initialIndex = nextIndex;
            let [name, count] = [t[0], t[1]];
            while (count > 0) {
                if (nextIndex >= people.length) {
                    nextIndex = 0;
                }
                let candidate = people[nextIndex++];
                if (candidate.indexOf(name) == -1 && candidate.length == assignments) {
                    candidate.push(name);
                    count --;
                } else if (nextIndex == initialIndex) {
                    moreAssignmentsMayBePossible = false;
                    break outer; // no more assignments possible
                }
            }
        }
        assignments ++; // yay! finished a full assignment
    }
    // drop extra tasks from over-burdened people
    people.forEach((o) => o.length = assignments);
    return assignments;
}

assign(tasks, people);
people.forEach((o, i) => console.log(i, o.length, o.join(", ")));