A preemptive bound for the resource constrained project scheduling problem

DOI10.1007/s10951-013-0354-9zbMath1297.90046OpenAlexW1988525203MaRDI QIDQ398922

Emmanuel Néron, Jacques Carlier, Anis Kooli, Mohamed Haouari

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0354-9

zbMATH Keywords

linear programmingresource constrained project scheduling problemdestructive lower boundspreemptive relaxation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Two deadline reduction algorithms for scheduling dependent tasks on parallel processors

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Explaining the \texttt{cumulative} propagator
• Event-based MILP models for resource-constrained project scheduling problems
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• PSPLIB -- a project scheduling problem library
• On linear lower bounds for the resource constrained project scheduling problem.
• Project scheduling. A research handbook.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• A new LP-based lower bound for the cumulative scheduling problem
• A fast algorithm for the maximum clique problem
• Enhanced energetic reasoning-based lower bounds for the resource constrained project 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
• Tight LP bounds for resource constrained project scheduling
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
• Solving Project Scheduling Problems by Minimum Cut Computations
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs

This page was built for publication: A preemptive bound for the resource constrained project scheduling problem