At t=[0, t] period, arrange M for N individual job, everyone can do different jobs in different time, every job can also be arranged in different time for different people, however, at the same time, each person can only do a job, every job also can only be done by a person, because of a change in the status of people, at different times have different work for its do,
Known: [0, T] in every moment, if someone can do a job, which can be expressed as a N * M * T matrix,
Goal: to maximize all working hours,
Thank you for your bosses
CodePudding user response:
Can use multiple knapsack problem to solve,