A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126351477, #quickstatements; #temporary_batch_1718132002366 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00305-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2132709136 / rank | |||
Normal rank | |||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations |
scientific article |
Statements
A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (English)
0 references
27 November 2000
0 references
project management
0 references
critical path methods
0 references
branch-and-bound
0 references
generalized precedence relations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
