Publication:3426431
From MaRDI portal
zbMath1127.90078MaRDI QIDQ3426431
Publication date: 9 March 2007
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
A rough-cut capacity planning model with overlapping, Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres, Project scheduling with finite or infinite number of activity processing modes -- a survey, Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound, 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: an exact algorithm