Computing redundant resources for the resource constrained project scheduling problem (Q853022): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049403394 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing redundant resources for the resource constrained project scheduling problem |
scientific article |
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
