z-logo
open-access-imgOpen Access
Note—Optimal Pricing Policy for the Service Facility Offering a Set of Priority Prices
Author(s) -
Hanna Alperstein
Publication year - 1988
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.34.5.666
Subject(s) - purchasing , service (business) , revenue , monopoly , fifo and lifo accounting , queue , profit (economics) , operations research , limit (mathematics) , microeconomics , economics , business , computer science , operations management , marketing , mathematics , finance , mathematical analysis , fifo (computing and electronics) , computer hardware , programming language
A profit making service facility that offers a set of different prices for the single service it provides is considered. By paying a higher price, the customer buys into a priority class that shortens his stay in the service system. We determine the optimal number of priority classes and the set of prices that affords the service facility a higher revenue than any other set. Relying on Adiri and Yechiali (Adiri, I., U. Yechiali. 1974. Optimal priority-purchasing and pricing decisions in non monopoly and monopoly queues. Oper. Res. 22 1051--1066.) who demonstrated that the customers' optimal priority-purchasing strategy is of the control limit type, we prove that for every set of M(>1) priority prices that are optimal to the service facility, the control limits of all priority classes equal one except the control limit of the highest priority class that is determined by the parameters of the system. We show that the highest priority class also has a control limit of one when the service facility uses the optimal M and optimal priority prices. Thus full optimality results in implementation of the pure LIFO (Last-In-First-Out) service discipline.priority prices, queueing, control limit type

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here