Show simple item record

dc.contributor.authorBecker, K.J.
dc.contributor.authorGaver, D.P.
dc.contributor.authorGlazebrook, K.D.
dc.contributor.authorJacobs, P.A.
dc.contributor.authorLawphongpanich, S.
dc.date.accessioned2014-03-25T16:54:47Z
dc.date.available2014-03-25T16:54:47Z
dc.date.issued2008
dc.identifier.citationEuropean Journal of Operational Research 126 (2000) 80±88
dc.identifier.urihttp://hdl.handle.net/10945/39590
dc.description.abstractThis 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.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleAllocation of tasks to specialized processors: A planning approachen_US
dc.typeArticleen_US
dc.contributor.departmentComputer Science (CS)
dc.subject.authorQueuingen_US
dc.subject.authorJob allocationen_US
dc.subject.authorService Systemen_US
dc.subject.authorOptimizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record