Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882): Difference between revisions
From MaRDI portal
Latest revision as of 01:24, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Online scheduling on unbounded parallel-batch machines with incompatible job families |
scientific article |
Statements
Online scheduling on unbounded parallel-batch machines with incompatible job families (English)
0 references
10 May 2011
0 references
online scheduling
0 references
parallel-batch machines
0 references
incompatible job families
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references