Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944)
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: Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine |
scientific article; zbMATH DE number 6578610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine |
scientific article; zbMATH DE number 6578610 |
Statements
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (English)
0 references
10 May 2016
0 references
parallel-batch scheduling
0 references
online algorithm
0 references
analysis of algorithms
0 references
unbounded machine
0 references
total weighted completion time
0 references
0 references
0 references
0.9113238453865052
0 references
0.911259651184082
0 references
0.9104390740394592
0 references
0.8959119915962219
0 references
