Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems

DOI10.14279/DEPOSITONCE-14478MaRDI QIDQ4938774zbMATH OpenFDO

Authors Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz

Publication date 23 February 2000

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-14478

zbMATH Keywords

Lagrangian approachLagrangian lower boundslower boundspolynomial-time algorithmscheduling problem

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solving project scheduling problems by minimum cut computations
• Lower bounds for resource-constrained project scheduling problems.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• On linear lower bounds for the resource constrained project scheduling problem.
• scientific article; zbMATH DE number 5132358

Cited in

(20)

• Lower bounds for resource-constrained project scheduling problems.
• On linear lower bounds for the resource constrained project scheduling problem.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• A new LP-based lower bound for the cumulative scheduling problem
• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• Redundant cumulative constraints to compute preemptive bounds
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
• PERT scheduling with convex cost functions.
• Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
• Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
• Solving project scheduling problems by minimum cut computations
• Practical solutions for a dock assignment problem with trailer transportation
• THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT
• scientific article; zbMATH DE number 5132358 (Why is no real title available?)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
• Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
• Optimization guided lower and upper bounds for the resource investment problem
• On project scheduling with irregular starting time costs
• Scheduling and constraint propagation
• Computing redundant resources for the resource constrained project scheduling problem

Describes a project that uses

Uses Software

• PSPLIB

This page was built for publication: Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems

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