Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-003-1037-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089938457 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Better Bounds for Online Scheduling / rank | |||
Normal rank | |||
Latest revision as of 18:09, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-on-line scheduling on two parallel processors with an upper bound on the items |
scientific article |
Statements
Semi-on-line scheduling on two parallel processors with an upper bound on the items (English)
0 references
11 February 2005
0 references
Scheduling
0 references
Two parallel processors
0 references
Semi-on-line
0 references
Competitive analysis
0 references
