scientific article
From MaRDI portal
Publication:3426431
zbMath1127.90078MaRDI QIDQ3426431
Publication date: 9 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
A rough-cut capacity planning model with overlapping ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
This page was built for publication:
