The optimal scheduling problem for machines with different productivity

The problem of scheduling work for an iteration in Scrum methodology is considered. It is considered as an optimal scheduling problem for machines with different unrelated productivity. The main characteristics of the problem include the existence of a common due date for all the machines, different unrelated productivity of the machines, the partial strict ordering set for the tasks and the value set for each of the tasks to be scheduled. The semantic and formal models of the problem are specified. A heuristic algorithm to solve the considered problem is suggested. It is based on the idea of splitting the problem into two different subproblems. For each of the resulting subproblems a formal model is specified. A greedy algorithm for finding a feasible solution is suggested for one of the subproblems.