As precedence relations and resource constraints must be considered concurrently, this problem is so difficult to solve completely that it belongs to NP-hard.

• 解决这类问题必须同时处理工序的前后关系约束和资源约束,使得它比一般调度问题更加难以解决,属于NP-难问题。