A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling (Q4474071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2080976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling |
scientific article; zbMATH DE number 2080976 |
Statements
4 August 2004
0 references
0.9127990007400512
0 references
0.8940615653991699
0 references
0.8891758918762207
0 references
0.8865752220153809
0 references
A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling (English)
0 references