An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614)
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 6066910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations |
scientific article; zbMATH DE number 6066910 |
Statements
An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (English)
0 references
16 August 2012
0 references
branch and bound
0 references
generalized precedence relationships
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0.9195243
0 references
0.9093373
0 references
0.9031247
0 references
0 references
0.89416766
0 references
0.8933032
0 references
0.89152724
0 references
0.8899848
0 references
