Semi-online hierarchical scheduling problems with buffer or rearrangements (Q1943630): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2012.12.007 / rank | |||
| Property / author | |||
| Property / author: György Dósa / rank | |||
| Property / author | |||
| Property / author: György Dósa / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.12.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994612842 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2012.12.007 / rank | |||
Normal rank | |||
Latest revision as of 15:43, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-online hierarchical scheduling problems with buffer or rearrangements |
scientific article |
Statements
Semi-online hierarchical scheduling problems with buffer or rearrangements (English)
0 references
20 March 2013
0 references
analysis of algorithms
0 references
semi-online scheduling
0 references
competitive ratio
0 references
hierarchy
0 references
