scientific article; zbMATH DE number 4051338

From MaRDI portal
Publication:3787783





The paper describes two ways of developing heuristic algorithms for project scheduling with resource constraints. The first approach is of constructive nature: the activities of the project go into the feasible schedule as soon as their precedence constraints are satisfied and the resource infeasibilities are solved by different rules. The second approach is based on the idea of disjunctive arcs for solving the resource incompatibilities between activities. Several decision rules for selecting the incompatible set and for fixing the arc in the selected set are considered. The computational performance of the proposed algorithms is extensively tested on a set of eigthyfour randomly generated problems, varying the problem size, the network complexity and the strength of the resource constraints.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787783)