A min-flow algorithm for minimal critical set detection in resource constrained project scheduling

DOI10.1016/J.ARTINT.2011.12.001zbMATH Open1248.90051OpenAlexW2028327036MaRDI QIDQ456733FDOQ456733

Michele Lombardi, Michela Milano

Publication date: 16 October 2012

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2011.12.001

Recommendations

• Solving project scheduling problems by minimum cut computations
• Solving resource-constrained project scheduling problems by a* search
• scientific article; zbMATH DE number 4197725
• A branch and bound algorithm for the resource-constrained project scheduling problem
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations

zbMATH Keywords

constraint programmingconstraint-based schedulingmin-flow algorithmminimal critical setprecedence constraint posting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• PSPLIB -- a project scheduling problem library
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Temporal constraint networks
• Algorithmic graph theory and perfect graphs
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• Title not available (Why is that?)
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Principles and Practice of Constraint Programming – CP 2004
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A constraint-based method for project scheduling with time windows
• From precedence constraint posting to partial order schedules. A CSP approach to robust scheduling
• Incremental computation of resource-envelopes in producer-consumer models

Cited In (3)

• New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem
• CROSS cyclic resource-constrained scheduling solver
• THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT

Uses Software

• PSPLIB

This page was built for publication: A min-flow algorithm for minimal critical set detection in resource constrained project scheduling

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