摘要：When dealing with resource-constrained project scheduling problem (RCPSP), the classical serial and parallel schedule generation schemes (SGSs) are often used as core components by heuristics. In this paper, a new serial insertion SGS for the RCPSP is proposed. The new SGS differs from the classical ones in the fact that it allows to insert an unscheduled activity inside the optimal insertion position at each iteration of serial scheduling, which can eventually leads to a compact project schedule. Computational experiments are conducted to show that the new polynomial-time scheme is effective in reducing project makespan and efficient in shortening runtime compared to another insertion SGS.
