Lower bounds for resource-constrained project scheduling problems.

DOI10.1016/S0377-2217(02)00762-2zbMath1036.90038OpenAlexW1965004458MaRDI QIDQ1399575

Peter Brucker, Sigrid Knust

Publication date: 30 July 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00762-2

zbMATH Keywords

column generationlower boundsconstraint propagationSchedulingmulti-moderesource-constrained project scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations, Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Computing redundant resources for the resource constrained project scheduling problem, Scheduling the truckload operations in automatic warehouses, The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan, Project scheduling with finite or infinite number of activity processing modes -- a survey, New concepts for activity float in resource-constrained project management, A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints, A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times, Considering project management activities for engineering design groups, The preemptive stochastic resource-constrained project scheduling problem, A random key based genetic algorithm for the resource constrained project scheduling problem, A general model for cyclic machine scheduling problems, New model and heuristics for safety stock placement in general acyclic supply chain networks, Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Project selection, scheduling and resource allocation with time dependent returns, Resource-constrained project scheduling: Notation, classification, models, and methods, A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects

Uses Software

• PSPLIB

Cites Work

• A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
• PSPLIB -- a project scheduling problem library
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Project scheduling with multiple modes: A comparison of exact algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item