Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306)
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: Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan |
scientific article; zbMATH DE number 5886879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan |
scientific article; zbMATH DE number 5886879 |
Statements
Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (English)
0 references
11 May 2011
0 references
project scheduling
0 references
discrete resource
0 references
continuous resource
0 references
makespan
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
0.8915993571281433
0 references
0.8699350357055664
0 references
0.8611031174659729
0 references
0.8564814329147339
0 references
