Online unbounded batch scheduling on parallel machines with delivery times (Q2354308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6457768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online unbounded batch scheduling on parallel machines with delivery times |
scientific article; zbMATH DE number 6457768 |
Statements
Online unbounded batch scheduling on parallel machines with delivery times (English)
0 references
10 July 2015
0 references
scheduling
0 references
online algorithm
0 references
batch machines
0 references
delivery times
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
0 references
0.9714911
0 references
0.96320385
0 references
0.95082694
0 references
0 references
0.94782317
0 references
0.9470709
0 references
0.9440956
0 references
0 references
0.9411649
0 references
