Name
Title | ||
|---|---|---|
k-server problems with bulk requests: an application to tool switching in manufacturing |
Abstract | ||
|---|---|---|
The classical k-server problem has been widely used to model two-level memory systems (e.g., paging and caching). The problem
is to plan the movements of k mobile servers on the vertices of a graph under an on-line sequence of requests. We generalize
this model in order to process a sequence of bulk requests and formulate, in this way, a valid model for the usual two-level
tooling configuration in automated production systems. A slight adaptation of the so-called Partitioning Algorithm provides
an on-line algorithm for this more general case, preserving basically the same competitive properties as the classical model.
This approach yields a new tool management procedure in manufacturing which outperforms in its quality the usual methods that
are based on heuristics for the traveling salesman problem. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1023/A:1018939132489 | Annals of Operations Research |
Keywords | Field | DocType |
paging,on-line tool switching,k,-server problems,competitive analysis,90B30,90B35 | Graph,Mathematical optimization,Tool management,Vertex (geometry),Computer science,Server,Travelling salesman problem,Heuristics,Paging,Competitive analysis | Journal |
Volume | Issue | ISSN |
96 | 1 | 1572-9338 |
Citations | PageRank | References |
2 | 0.43 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Caroline Privault | 1 | 25 | 3.07 |
| Gerd Finke | 2 | 181 | 15.63 |