View Item 

Show simple item record

Optimal Uniform Pricing Strategy of a Service Firm When Facing Two Classes of Customers

dc.contributor.authorZhou, Wenhuien_US
dc.contributor.authorChao, Xiulien_US
dc.contributor.authorGong, Xitingen_US
dc.date.accessioned2014-05-23T15:59:03Z
dc.date.available2015-06-01T15:48:45Zen_US
dc.date.issued2014-04en_US
dc.identifier.citationZhou, Wenhui; Chao, Xiuli; Gong, Xiting (2014). "Optimal Uniform Pricing Strategy of a Service Firm When Facing Two Classes of Customers." Production and Operations Management 23(4): 676-688.en_US
dc.identifier.issn1059-1478en_US
dc.identifier.issn1937-5956en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/106838
dc.publisherKluwer Publishingen_US
dc.publisherWiley Periodicals, Inc.en_US
dc.subject.otherOptimal Pricingen_US
dc.subject.otherDelay‐Sensitive Customersen_US
dc.subject.otherQueueing Delaysen_US
dc.subject.otherService Systemen_US
dc.titleOptimal Uniform Pricing Strategy of a Service Firm When Facing Two Classes of Customersen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/106838/1/poms12171.pdf
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/106838/2/poms12171-sup-0001-Onlinesupplement.pdf
dc.identifier.doi10.1111/poms.12171en_US
dc.identifier.sourceProduction and Operations Managementen_US
dc.identifier.citedreferenceNaor, P. 1969. The regulation of queue size by levying tolls. Econometrica 37 ( 1 ): 15 – 24.en_US
dc.identifier.citedreferenceChen, H., M. Frank. 2004. Monopoly pricing when customers queue. IIE Trans. 36 ( 6 ): 569 – 581.en_US
dc.identifier.citedreferenceChen, H., Y.‐W. Wan. 2003. Price competition of make‐to‐order firms. IIE Trans. 35 ( 9 ): 817 – 832.en_US
dc.identifier.citedreferenceDe Vany, A. 1976. Uncertainty, waiting time, and capacity utilization: A stochastic theory of product quality. J. Polit. Econ. 84 ( 3 ): 523 – 541.en_US
dc.identifier.citedreferenceEdelson, N. M., D. K. Hilderbrand. 1975. Congestion tolls for Poisson queueing processes. Econometrica 43 ( 1 ): 81 – 92.en_US
dc.identifier.citedreferenceGilland, W. G., D. P. Warsing. 2009. The impact of revenue‐maximizing priority pricing on customers delay costs. Decis. Sci. 40 ( 1 ): 89 – 120.en_US
dc.identifier.citedreferenceHassin, R. 1986. Consumer information in markets with random product quality: The case of queues and balking. Econometrica 54 ( 5 ): 1185 – 1195.en_US
dc.identifier.citedreferenceHassin, R., M. Haviv. 1997. Equilibrium threshold strategies: The case of queues with priorities. Oper. Res. 45 ( 6 ): 966 – 973.en_US
dc.identifier.citedreferenceHassin, R., M. Haviv. 2002. To Queue or Not to Queue. International Series in Operations Research and Management Science, volume 59, Kluwer Publishing, Boston.en_US
dc.identifier.citedreferenceKleinrock, L. 1975. Queueing Systems, Volume I: Theory. John Wiley & Sons, New York.en_US
dc.identifier.citedreferenceKnudsen, N. C. 1972. Individual and social optimization in a multi‐server queue with a general cost‐benefit structure. Econometrica 40 ( 3 ): 515 – 528.en_US
dc.identifier.citedreferenceLippman, S., S. Stidham. 1977. Industrial versus social optimization in exponential congestion systems. Oper. Res. 25 ( 2 ): 233 – 247.en_US
dc.identifier.citedreferenceMandelbaum, A., A. Sakov, S. Zeltyn. 2001. Empirical analysis of a call center. Technical Report, Technion–Israel Institute of Technology. Available at http://ie.technion.ac.il/serveng/References/ccdata.pdf (accessed date October 13, 2013).en_US
dc.identifier.citedreferenceMendelson, H., S. Whang. 1990. Optimal incentive‐compatible priority pricing for the M/M/1 queue. Oper. Res. 38 ( 5 ): 870 – 883.en_US
dc.identifier.citedreferenceNozaki, S. A., S. M. Ross. 1978. Approximation in finite‐capacity multi‐server queues with Poisson arrivals. J. Appl. Probability 15 ( 4 ): 826 – 834.en_US
dc.identifier.citedreferenceRao, S., E. R. Petersen. 1998. Optimal pricing of priority services. Oper. Res. 46 ( 1 ): 46 – 56.en_US
dc.identifier.citedreferenceStidham, S. jr. 2009. Optimal Design of Queueing Systems. Chapman and Hall/CRC, Boca Raton, FL.en_US
dc.identifier.citedreferenceStidham, S. jr. 2011. Optimal Control of Queueing Systems. Chapman and Hall/CRC, Boca Raton, FL.en_US
dc.identifier.citedreferenceVan Mieghem, J. A. 2000. Price and service discrimination in queueing systems: Incentive compatibility of Gc μ scheduling. Manage. Sci. 46 ( 9 ): 1249 – 1267.en_US
dc.identifier.citedreferenceWhitt, W. 1993. Approximations for the GI/G/m queue. Prod. Oper. Manag. 2 ( 2 ): 114 – 161.en_US
dc.identifier.citedreferenceAfanasyev, M., H. Mendelson. 2010. Service provider competition: Delay cost structure, segmentation and cost advantage. Manuf. Serv. Oper. Manag. 12 ( 2 ): 213 – 235.en_US
dc.identifier.citedreferenceAfèche, P., H. Mendelson. 2004. Pricing and priority auctions in queueing systems with a generalized delay cost structure. Manage. Sci. 50 ( 7 ): 869 – 882.en_US
dc.identifier.citedreferenceArmony, M., M. Haviv. 2003. Price and delay competition between two service providers. Eur. J. Oper. Res. 147 ( 1 ): 32 – 50.en_US
dc.identifier.citedreferenceBell, C. E., S. Stidham, Jr. 1983. Individual versus social optimization in the allocation of customers to alternative servers. Manage. Sci. 29 ( 7 ): 831 – 839.en_US
dc.identifier.citedreferenceBradford, R. 1996. Pricing, routing, and incentive compatibility in multiserver queues. Eur. J. Oper. Res. 89 ( 2 ): 226 – 236.en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
poms12171.pdf
Size:
348.9KB
Format:
PDF
View/Open
Name:
poms12171-sup-0001-Onlinesuppl ...
Size:
575.8KB
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.