Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
From MaRDI portal
Publication:1412119
zbMath1054.90039MaRDI QIDQ1412119
Jürgen Zimmermann, Klaus Neumann
Publication date: 2002
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
branch-and-boundnet present valueresource-constrained project schedulinggeneral temporal constraintssteepest ascent approach
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
