C语言排班系统设计如何实现排班算法？

void greedy_scheduling(Employee employees[], int employee_count, Shift shifts[], int shift_count, int schedule[][DAY_COUNT]) {
for (int day = 0; day < DAY_COUNT; day++) {
for(int shift_index = 0; shift_index < shift_count; shift_index++){
for(int j = 0; j < shifts[shift_index].required_employees; j++){
int best_employee = -1;
for (int i = 0; i < employee_count; i++) {
if (employees[i].available[day] && employees[i].preference[shifts[shift_index].shift_type] != 0 && schedule[i][day] == 0 ) { // 员工可用，偏好班次，且未排班
if (best_employee == -1 || employees[i].skill_level > employees[best_employee].skill_level) {
best_employee = i;
}
}
}
if(best_employee != -1){
schedule[best_employee][day] = shifts[shift_index].id;
}
}
}
}
}