Research on Resource Selection with Precedence and Due Date Constraint

In this paper, we consider the resource selection problem with due date constraint in production planning and control where the subtasks form a precedence network. We prove that this problem is NP-complete. Thus this problem cannot have any polynomial time solution algorithm at present. We establish a nonlinear integer-programming model for this problem, and prove the monotonicity properties of the objective function and constraint function in the model. Basing on our observations, we construct a Branch & Bound method to solve the problem. The test results show that this algorithm is effective.