Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848)
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 6536809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time |
scientific article; zbMATH DE number 6536809 |
Statements
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (English)
0 references
28 January 2016
0 references
online scheduling
0 references
batch machine
0 references
drop-line
0 references
competitive ratio
0 references
0 references
0.8950575590133667
0 references
0.8949211239814758
0 references
0.8929058313369751
0 references
0.8899927735328674
0 references
0.8805638551712036
0 references
