On linear lower bounds for the resource constrained project scheduling problem.

DOI10.1016/S0377-2217(02)00763-4zbMath1040.90017MaRDI QIDQ1399576

Jacques Carlier, Emmanuel Néron

Publication date: 30 July 2003

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

zbMATH Keywords

linear programming; lower bounds; resource-constrained project scheduling; redundant resources

Mathematics Subject Classification ID

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

Related Items

A preemptive bound for the resource constrained project scheduling problem, Project scheduling with flexible resources: formulation and inequalities, A survey of dual-feasible and superadditive functions, New concepts for activity float in resource-constrained project management, Event-based MILP models for resource-constrained project scheduling problems, Approximability results for the resource-constrained project scheduling problem with a single type of resources, Computing redundant resources for the resource constrained project scheduling problem

Uses Software

• PSPLIB
• CLAIRE
• BL data set

Cites Work

• Lower bounds and reduction procedures for the bin packing problem
• Scheduling subject to resource constraints: Classification and complexity
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• PSPLIB -- a project scheduling problem library
• A branch and bound algorithm 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
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item