An on-line algorithm for the bounded \(P\)-batch scheduling with chain precedence constraints and unit processing time (Q3070914)
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 5842478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An on-line algorithm for the bounded \(P\)-batch scheduling with chain precedence constraints and unit processing time |
scientific article; zbMATH DE number 5842478 |
Statements
28 January 2011
0 references
0.8566538691520691
0 references
0.8297006487846375
0 references
0.8291923403739929
0 references
0.8283078670501709
0 references
0.8268187046051025
0 references
