Resource-Task Assignment Process with Rejections and Reassignments

We present a simple model for the resource-task assignment process with rejections and reassignments, where the assignment rejection probabilities are considered explicitly. Particularly, we assume that each resource can serve at most one task, and provide several approaches for solving the problem. For many application fields, the assignment rejection probabilities can be obtained from the historical data, the model and solution approaches provided in this paper may help to make better assignment decisions.