scientific article; zbMATH DE number 4051338
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.
- A comparative study of computational procedures for the resource constrained project scheduling problem
- Heuristics for resource-constrained scheduling†
- Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
- scientific article; zbMATH DE number 4197725
- Development of a heuristic project scheduler under resource constraints
- A comparative study of computational procedures for the resource constrained project scheduling problem
- Heuristics for scheduling resource-constrained projects in MPM networks
- Heuristics for resource-constrained scheduling†
- Heuristics for a project management problem with incompatibility and assignment costs
- An investigation into the relationship of heuristic performance with network-resource characteristics
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- scientific article; zbMATH DE number 4197725 (Why is no real title available?)
- Deterministic and sampling heuristic algorithms for project scheduling with resource constraints
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
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)