A preemptive bound for the resource constrained project scheduling problem
DOI10.1007/S10951-013-0354-9zbMATH Open1297.90046OpenAlexW1988525203MaRDI QIDQ398922FDOQ398922
Authors: Mohamed Haouari, Anis Kooli, E. Néron, Jacques Carlier 
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
Recommendations
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Lower bounds for resource-constrained project scheduling problems.
- On some implementations of solving the resource constrained project scheduling problems
- Tight LP bounds for resource constrained project scheduling
linear programmingresource constrained project scheduling problemdestructive lower boundspreemptive relaxation
Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Cites Work
- PSPLIB -- a project scheduling problem library
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- A fast algorithm for the maximum clique problem
- Project scheduling. A research handbook.
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Explaining the \texttt{cumulative} propagator
- Event-based MILP models for resource-constrained project scheduling problems
- Title not available (Why is that?)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- Solving project scheduling problems by minimum cut computations
- On linear lower bounds for the resource constrained project scheduling problem.
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- A new LP-based lower bound for the cumulative scheduling problem
- Title not available (Why is that?)
- Tight LP bounds for resource constrained project scheduling
- Timetable edge finding filtering algorithm for discrete cumulative resources
- 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
Cited In (10)
- Title not available (Why is that?)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Measuring the slack between lower bounds for scheduling on parallel machines
- Tight LP bounds for resource constrained project scheduling
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- 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
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- Pre-emption in resource-constrained project scheduling
Uses Software
This page was built for publication: A preemptive bound for the resource constrained project scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398922)
