Interdiction modeling under resource constraints

Resolve the modeling question for the Project Scheduling Interdiction Problem with Delay Groups under resource constraints, where project makespan is no longer determined by a longest path and the inner interdiction problem consequently changes fundamentally.

Background

The current PSIP-DG formulation relies on the fact that, in an activity-on-node network without resource constraints, the makespan equals the length of a longest source-to-sink path. Resource constraints introduce interactions among activities and invalidate this longest-path characterization.

The authors explicitly flag the resulting formulation of the inner adversarial problem as a non-trivial unresolved modeling issue.

References

The resource-constrained extension is particularly interesting but raises a non-trivial modeling question: under resource constraints, the makespan is no longer determined by a longest path, so the inner problem of the interdiction model changes fundamentally.

— The Project Scheduling Interdiction Problem with Delay Groups  (2608.27386 - Wu et al., 27 Aug 2026) in Section Conclusions