Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A lower bound for the job insertion problem
Discrete Applied Mathematics
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
Journal of Scheduling
A classification of predictive-reactive project scheduling procedures
Journal of Scheduling
| Hi-index | 0.00 |
This paper considers the resource-constrained activity insertion problem with minimum and maximum time lags. The problem involves inserting a single activity in a partial schedule while preserving its structure represented through resource flow networks and minimizing the makespan increase caused by the insertion. In the general case, we show that finding a feasible insertion that minimizes the project duration is NP-hard. When only minimum time lags are considered and when activity durations are strictly positive, we show that the problem is polynomially solvable, generalizing previously established results on activity insertion for the standard resource-constrained project scheduling problem.