On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations

DOI10.1007/s00291-015-0419-6zbMath1339.90151OpenAlexW1950591123WikidataQ59389548 ScholiaQ59389548MaRDI QIDQ280157

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

zbMATH Keywords

project schedulingconstraint programminggeneralized precedence relationsmulti-modeSAT solving

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Editorial ``Project management and scheduling, Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic, The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds, Considering project management activities for engineering design groups, An updated survey of variants and extensions of the resource-constrained project scheduling problem, Stochastic project scheduling with hierarchical alternatives

Uses Software

• PSPLIB
• SCIP
• Chaff
• cumulativemm
• gprecedencemm
• CPU Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Explaining the \texttt{cumulative} propagator
• SCIP: solving constraint integer programs
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• PSPLIB -- a project scheduling problem library
• 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
• Complex Scheduling
• Principles of Constraint Programming
• GRASP: a search algorithm for propositional satisfiability
• Exploiting Erraticism in Search
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems