Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407)
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 makespan and total completion time for parallel batch processing machines with non-identical job sizes |
scientific article; zbMATH DE number 6114168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes |
scientific article; zbMATH DE number 6114168 |
Statements
Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (English)
0 references
7 December 2012
0 references
batch scheduling
0 references
non-identical job sizes
0 references
parallel machines
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8980726003646851
0 references
0.8904348611831665
0 references
0.8879889249801636
0 references
0.8870547413825989
0 references
0.8858570456504822
0 references
