Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:49, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithms for uniform machine scheduling with processing set restrictions |
scientific article |
Statements
Fast approximation algorithms for uniform machine scheduling with processing set restrictions (English)
0 references
29 May 2018
0 references
scheduling
0 references
uniform machines
0 references
inclusive processing set
0 references
tree-hierarchical processing set
0 references
makespan
0 references
worst-case bound
0 references
