New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem
From MaRDI portal
Recommendations
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- On some implementations of solving the resource constrained project scheduling problems
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
- A survey of variants and extensions of the resource-constrained project scheduling problem
Cites work
- A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem
- A min-flow algorithm for minimal critical set detection in resource constrained project scheduling
- A polyhedral study of event-based models for the resource-constrained project scheduling problem
- A project scheduling problem with periodically aggregated resource-constraints
- A robust time-cost-quality-energy-environment trade-off with resource-constrained in project management: a case study for a bridge construction project
- A stochastic maximum principle for a Markov regime-switching jump-diffusion model with delay and an application to finance
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
- A tree search heuristic for the resource constrained project scheduling problem with transfer times
- An efficient genetic algorithm for decentralized multi-project scheduling with resource transfers
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- An inventory model under uncertain inflationary conditions, finite production rate and inflation-dependent demand rate for deteriorating items with shortages
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Branch-and-price approach for the multi-skill project scheduling problem
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Critical-Path Planning and Scheduling: Mathematical Basis
- Event-based MILP models for resource-constrained project scheduling problems
- Fuzzy mathematical programming approaches for reverse supply chain optimization with disassembly line balancing problem
- Fuzzy target-environment networks and fuzzy-regression approaches
- Improved selection in evolutionary multi-objective optimization of multi-skill resource-constrained project scheduling problem
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
- Multi-objective decision analysis for competence-oriented project portfolio selection
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- On the integration of diverging material flows into resource-constrained project scheduling
- Project scheduling with flexible resources: formulation and inequalities
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Scheduling subject to resource constraints: Classification and complexity
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Tabu search and simulated annealing for resource-constrained multi-project scheduling to minimize maximal cash flow gap
Cited in
(2)
This page was built for publication: New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102886)
