View Item 

Show simple item record

Optimal batch service of a polling system under partial information
dc.contributor.authorOyen, Mark P.en_US
dc.contributor.authorTeneketzis, Demosthenisen_US
dc.date.accessioned2006-09-11T16:32:00Z
dc.date.available2006-09-11T16:32:00Z
dc.date.issued1996-10en_US
dc.identifier.citationOyen, Mark P.; Teneketzis, Demosthenis; (1996). "Optimal batch service of a polling system under partial information." Mathematical Methods of Operations Research 44(3): 401-419. <http://hdl.handle.net/2027.42/45841>en_US
dc.identifier.issn1432-5217en_US
dc.identifier.issn1432-2994en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/45841
dc.description.abstractWe consider the optimal scheduling of an infinite-capacity batch server in a N -node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies.en_US
dc.format.extent1007302 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherPhysica-Verlag; Springer Science+Business Mediaen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherBusiness/Management Science, Generalen_US
dc.subject.otherMathematicsen_US
dc.subject.otherOptimizationen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.titleOptimal batch service of a polling system under partial informationen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Electrical Engineering and Computer Science, University of Michigan, 48109-2122, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherDepartment of Industrial Engineering and Management Sciences, Northwestern University, 60208-3119, Evanston, IL, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/45841/1/186_2005_Article_BF01193939.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01193939en_US
dc.identifier.sourceMathematical Methods of Operations Researchen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
186_2005_Article_BF01193939.pdf
Size:
983.6KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.