Allocation of Jobs to Unequally-Capable Processors: A Planning Approach

dc.contributor.authorGaver, Donald Paul
dc.contributor.authorJacobs, Patricia A.
dc.contributor.authorBecker, Kevin J.
dc.contributor.authorLawphongpanich, Siriphong
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentOperations Research
dc.date1996-09
dc.date.accessioned2013-03-07T21:51:42Z
dc.date.available2013-03-07T21:51:42Z
dc.date.issued1996-09
dc.description.abstractThis paper addresses the problem in which jobs of different types arrive at a system that consists of a collection of individual and somewhat diverse processors. The processors differ in that each may spedalize in one job type, but may also do others. Job types that are totally incompatible with a processor have an infinite service on that processor, but degrees of incompatibility may exist, and are modeled here. Using static queuing models, several practical performance measures may be evaluated, and optimal allocation of jobs to processors are obtained by solving linear and nonlinear programming problems. To illustrate, several numerical examples are provided. It is shown that jobs are not always most advantageously assigned to their most expert serversen_US
dc.description.funderNAen_US
dc.description.sponsorshipNaval Postgraduate School, Monterey, CA.en_US
dc.description.urihttp://archive.org/details/allocationofjobs00gave
dc.identifier.npsreportNPS-OR-96-010
dc.identifier.oclcNA
dc.identifier.urihttps://hdl.handle.net/10945/29696
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_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.subject.authorqueuing models; allocation of jobs to unequal serversen_US
dc.titleAllocation of Jobs to Unequally-Capable Processors: A Planning Approachen_US
dc.typeTechnical Reporten_US
dspace.entity.typePublication
Files
Collections