Une méthode arborescente pour résoudre les problèmes cumulatifs
From MaRDI portal
(Redirected from Publication:3360656)
Recommendations
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
Cited in
(23)- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- Methods to solve multi-skill project scheduling problem
- Optimal parallel machines scheduling with availability constraints
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: A survey of recent developments.
- A preemptive bound for the resource constrained project scheduling problem
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Branch-and-price approach for the multi-skill project scheduling problem
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- On linear lower bounds for the resource constrained project scheduling problem.
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- IP-based energetic reasoning for the resource constrained project scheduling problem
This page was built for publication: Une méthode arborescente pour résoudre les problèmes cumulatifs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360656)
