An analysis of service schedules for the mobile k-server problem

DOI10.1016/0966-8349(95)00009-7zbMATH Open0916.90109OpenAlexW2124966619MaRDI QIDQ4229646FDOQ4229646

Authors: Weizhen Mao, Rex K. Kincaid 

Publication date: 21 July 1999

Published in: Location Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0966-8349(95)00009-7

Recommendations

• An application of various algorithms for solving the \(k\)-server problem
• The \(K\)-server problem via a modern optimization lens
• The single-node dynamic service scheduling and dispatching problem
• Locating a Mobile Server Queueing Facility on a Tree Network
• Location-allocation of multiple-server service centers with constrained queues or waiting times
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection
• The \(k\)-server problem
• Queueing networks with mobile servers: the mean-field approach

zbMATH Keywords

heuristicsjob schedulingworst-case performancemobile \(k\)-server problem

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (1)

• Algorithms and Computation

This page was built for publication: An analysis of service schedules for the mobile k-server problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229646)