A note on unbounded parallel-batch scheduling (Q495685): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2015.07.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2015.07.002 / rank | |||
Normal rank | |||
Revision as of 02:47, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on unbounded parallel-batch scheduling |
scientific article |
Statements
A note on unbounded parallel-batch scheduling (English)
0 references
15 September 2015
0 references
analysis of algorithm
0 references
parallel-batch scheduling
0 references
maximum cost
0 references
strongly polynomial time
0 references
Pareto optimization
0 references
0 references
