On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs |
scientific article |
Statements
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (English)
0 references
28 August 2009
0 references
on-line scheduling
0 references
batch machine
0 references
job families
0 references
competitive ratio
0 references
0 references
