Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2568573404 / rank | |||
Normal rank | |||
Revision as of 19:23, 19 March 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
