A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.05.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.05.014 / rank | |||
Normal rank | |||
Latest revision as of 00:58, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible on-line algorithm for scheduling on uniform parallel-batch machines |
scientific article |
Statements
A best possible on-line algorithm for scheduling on uniform parallel-batch machines (English)
0 references
8 June 2018
0 references
online algorithm
0 references
uniform machines
0 references
parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
0 references
0 references
