Order-based neighborhoods for project scheduling with nonregular objective functions. (Q1399577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1957041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Order-based neighborhoods for project scheduling with nonregular objective functions. |
scientific article; zbMATH DE number 1957041 |
Statements
Order-based neighborhoods for project scheduling with nonregular objective functions. (English)
0 references
30 July 2003
0 references
The resource-constrained project scheduling problem with general temporal constraints (minimal and maximal time-lags) and nonregular objective functions is studied. It is shown that for certain objective functions the search for an optimal solution can be restricted to special types of schedules. Based on these results appropriate neighborhoods (based on spanning trees of order networks) are developed, which are shown to be weakly connected.
0 references
resource-constrained project scheduling
0 references
nonregular objective functions
0 references
neighborhoods
0 references
0 references
0 references
0 references
0 references
0 references
0.7885133624076843
0 references
0.7738003730773926
0 references
