Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2017.01.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2017.01.013 / rank | |||
Normal rank | |||
Latest revision as of 08:20, 11 December 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
0 references
0 references
