Minimizing total completion time of batch scheduling with nonidentical job sizes (Q1699779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing total completion time of batch scheduling with nonidentical job sizes |
scientific article; zbMATH DE number 6843486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time of batch scheduling with nonidentical job sizes |
scientific article; zbMATH DE number 6843486 |
Statements
Minimizing total completion time of batch scheduling with nonidentical job sizes (English)
0 references
26 February 2018
0 references
0.9639647603034972
0 references
0.8879889249801636
0 references
0.8769773840904236
0 references
0.8682898283004761
0 references
0.8569789528846741
0 references
