Browse by author
Lookup NU author(s): Professor Kevin Glazebrook
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This paper addresses the problem of scheduling randomly arriving tasks of different types at a diversified service system. Servers at such a system differ in that each may specialize in one task type, but can also perform others perhaps less rapidly and adequately than does a specialist. We consider the issue of how much redirection of tasks from specialists to non-specialists may be desirable in such a system and propose a static model in which tasks are randomly assigned to servers. Two scheduling strategies for individual servers are also considered: one in which each server performs the tasks assigned to him or her in order of their arrival and the second in which each server schedules his or her workload optimally. The problems for finding the best random assignment probabilities are formulated as mathematical programs. Results from a numerical example provide information that is both informative and useful in decision-making.
Author(s): Becker KJ, Gaver DP, Glazebrook KD, Jacobs PA, Lawphongpanich S
Publication type: Article
Publication status: Published
Journal: European Journal of Operational Research
Year: 2000
Volume: 126
Issue: 1
Pages: 80-88
ISSN (print): 0377-2217
ISSN (electronic): 1872-6860
Publisher: Elsevier B.V.
URL: http://dx.doi.org/10.1016/S0377-2217(99)00282-9
DOI: 10.1016/S0377-2217(99)00282-9
Altmetrics provided by Altmetric
