Author:
Pandelis Dimitrios G.,Teneketzis Demosthenis
Abstract
We analyze service systems where Nservers (N > 2) move one at a time along an array of stations to satisfy a known number of requests for service. Processing a request consists of determining the server to satisfy the request. The cost of processing a request is determined by the distance the server that performs the request has to move. We determine qualitative properties of sequencing strategies that minimize the expected cost incurred by the service of all requests when the array of stations is on a circle or an interval.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Deterministic and stochastic scheduling with teamwork tasks;Naval Research Logistics;2004-09
2. Optimal Computer Disk Access;Probability in the Engineering and Informational Sciences;1998-04