scientific article; zbMATH DE number 4051338

MaRDI QIDQ3787783zbMATH OpenFDO

Authors Ramón Alvarez-Olaguibel, José Manuel Tamarit Goerlich, Vicente Valls Verdejo

Publication date 1988

zbMATH Keywords

branch and bounddisjunctive arcsdisjunctive graphsheuristic algorithmsprecedence constraintsproject schedulingrandomly generated problemsresource constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• 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

Cited in

(9)

• 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)