Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (Q2883566): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4133397 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving Project Scheduling Problems by Minimum Cut Computations / rank | |||
Normal rank | |||
Revision as of 04:24, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling |
scientific article |
Statements
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (English)
0 references
13 May 2012
0 references
modulo scheduling
0 references
resource constraints
0 references
minimum period
0 references
Lagrangian relaxation
0 references
