On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
DOI10.1007/S00291-015-0419-6zbMATH Open1339.90151OpenAlexW1950591123WikidataQ59389548 ScholiaQ59389548MaRDI QIDQ280157FDOQ280157
Authors: Alexander Schnell, Richard F. Hartl 
Publication date: 4 May 2016
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-015-0419-6
Recommendations
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- PSPLIB -- a project scheduling problem library
- SCIP: solving constraint integer programs
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Exploiting erraticism in search
- Scheduling subject to resource constraints: Classification and complexity
- Lower bounds for resource-constrained project scheduling problems.
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- Propagation via lazy clause generation
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Solving RCPSP/max by lazy clause generation
- A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
- Title not available (Why is that?)
- Complex Scheduling
- Principles of Constraint Programming
- Title not available (Why is that?)
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- GRASP: a search algorithm for propositional satisfiability
- Explaining the \texttt{cumulative} propagator
Cited In (10)
- A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
- Stochastic project scheduling with hierarchical alternatives
- Considering project management activities for engineering design groups
- Editorial ``Project management and scheduling
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
- The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
Uses Software
This page was built for publication: On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280157)
