An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2019

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

Abstract

Several algorithms for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem (RCPSP) were proposed in the literature. However, fast computable lower bounds usually do not provide the best estimations and the methods that obtain better bounds are mainly based on the cooperation between linear and constraint programming and therefore are time-consuming. In this paper, a new pseudo-polynomial algorithm is proposed to find a makespan lower bound for RCPSP with time-dependent resource capacities. Its idea is based on a consecutive evaluation of pairs of resources and their cumulated workload. Using the proposed algorithm, several bounds for the PSPLIB benchmark were improved. The results for industrial applications are also presented where the algorithm could provide good bounds even for very large problem instances.
Fichier principal
Vignette du fichier
Arkhipov_21875..pdf (1.72 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02002548 , version 1 (26-02-2019)

Identifiers

Cite

Dmitry I. Arkhipov, Alexander A. Lazarev, Olga Battaïa. An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. European Journal of Operational Research, 2019, 275 (1), pp.35-44. ⟨10.1016/j.ejor.2018.11.005⟩. ⟨hal-02002548⟩
37 View
67 Download

Altmetric

Share

Gmail Facebook X LinkedIn More