Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999)
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: Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays |
scientific article; zbMATH DE number 6992761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays |
scientific article; zbMATH DE number 6992761 |
Statements
Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (English)
0 references
12 December 2018
0 references
scheduling
0 references
parallel processors
0 references
communication delay
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
