Activity Insertion Problem in a RCPSP with Minimum and Maximum Time Lags
Résumé
This chapter considers the RCPSP with minimum and maximum time lags. We focus on the problem of activity insertion in a schedule represented by a resource flow, which can occur in reactive scheduling (see next chapter) or as a component of a local search method. We show the problem is NP-hard and propose a polynomial algorithm when only minimum time lags are considered.