Computing redundant resources for the resource constrained project scheduling problem (Q853022)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing redundant resources for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 5073130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing redundant resources for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 5073130 |
Statements
Computing redundant resources for the resource constrained project scheduling problem (English)
0 references
15 November 2006
0 references
In the paper so-called redundant functions are studied which are used for calculating redundant resources for the resource-constrained project scheduling problem (RCPSP). After giving formal definitions of redundant functions, maximal redundant functions (MRF), and dual feasible functions, an efficient algorithm is presented which enumerates all MRFs and identifies non-dominated ones. Finally, the derived concepts are used in computational experiments calculating lower bounds for the RCPSP.
0 references
resource-constrained project scheduling problem
0 references
lower bounds
0 references
redundant function
0 references
0 references
0 references
0 references
0 references
0.8501931428909302
0 references
0.8374291658401489
0 references
0.8306657075881958
0 references
0.8009738326072693
0 references
