Optimal on-line algorithms for one batch machine with grouped processing times (Q411231)
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 6021866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal on-line algorithms for one batch machine with grouped processing times |
scientific article; zbMATH DE number 6021866 |
Statements
Optimal on-line algorithms for one batch machine with grouped processing times (English)
0 references
4 April 2012
0 references
batching
0 references
scheduling
0 references
on-line algorithm
0 references
delivery time
0 references
0 references
0 references
0.9036522507667542
0 references
0.9034097194671632
0 references
0.8995737433433533
0 references
0.882283091545105
0 references
0.880782425403595
0 references
