Lower bounds for resource-constrained project scheduling problems.

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

Peter Brucker, Sigrid Knust

Publication date: 30 July 2003

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

zbMATH Keywords

column generation; lower bounds; constraint propagation; Scheduling; multi-mode; resource-constrained project scheduling problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

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, Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times, Computing redundant resources for the resource constrained project scheduling problem, Scheduling the truckload operations in automatic warehouses, 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, Resource-constrained project scheduling: Notation, classification, models, and methods, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Project selection, scheduling and resource allocation with time dependent returns

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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