An analysis of service schedules for the mobile k-server problem (Q4229646)
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 1253078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analysis of service schedules for the mobile k-server problem |
scientific article; zbMATH DE number 1253078 |
Statements
An analysis of service schedules for the mobile k-server problem (English)
0 references
21 July 1999
0 references
mobile \(k\)-server problem
0 references
job scheduling
0 references
worst-case performance
0 references
heuristics
0 references
0.8350531
0 references
0.83347964
0 references
0.8281975
0 references
0.82683194
0 references
0.82341295
0 references
0.82117784
0 references
