Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine |
scientific article |
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