On scheduling an unbounded batch machine (Q1870002)
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 1903526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On scheduling an unbounded batch machine |
scientific article; zbMATH DE number 1903526 |
Statements
On scheduling an unbounded batch machine (English)
0 references
4 May 2003
0 references
scheduling
0 references
batch processing
0 references
complexity
0 references
0.95590985
0 references
0.95485973
0 references
0.9354568
0 references
0.9323045
0 references
0.92838407
0 references
0.9268776
0 references
0.9236766
0 references
0.9156779
0 references
0.9155933
0 references
