Priority auctions and queue disciplines that depend on processing time

Management Science

Volumn 51, Issue 2, 2005, Pages 236-248

  Kittsteiner, Thomas ^a,b   Moldovanu, Benny ^b  

^a NUFFIELD COLLEGE   (United Kingdom)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Auctions; Delay cost; Incentive compatibility; Priority pricing; Queue disciplines; Queueing

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COST EFFECTIVENESS; CUSTOMER SATISFACTION; INDUSTRIAL MANAGEMENT; QUEUEING THEORY; RANDOM PROCESSES;

AUCTIONS; DELAY COSTS; INCENTIVE COMPATIBILITY; PRIORITY PRICING; QUEUE DISCIPLINES; QUEUING;

SCHEDULING;

EID: 14944353770     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1040.0301     Document Type: Article

References (29)

1. Afèche, P., H. Mendelson. 2004. Pricing and priority auctions in queueing systems with a generalized delay cost structure. Management Sci. 50 869-882.
2. Balachandran, K. 1972. Purchasing priorities in queues. Management Sci. 18 319-326.
3. Cobham, A. 1954. Priority assignment in waiting line problems. Oper. Res. 2 70-76.
4. Conway, R., W. Maxwell, L. Miller. 1967. Theory of Scheduling. Addison-Wesley, Reading, PA.
5. Dasgupta, P., E. Maskin. 2000. Efficient auctions. Quart. J. Econom. 115 341-388.
6. Dolan, R. 1978. Incentive mechanisms for priority queueing problems. Bell J. Econom. 9 421-436.
7. Economist, The. 2003. Debt collecting; Knock knock. (November 1) 39.
8. Edelson, N., K. Hildebrand. 1975. Congestion tolls for Poisson queueing processes. Econometrica 43 81-92.
9. Ghanem, S. 1975. Computing central optimization by a pricing priority policy. IBM Systems J. 14 272-292.
10. Glazer, A., R. Hassin. 1986. Stable priority purchasing in queues. Oper. Res. Lett. 4 285-288.
11. Hain, R., M. Mitra. 2002. Simple sequencing problems with interdependent costs. Games Econom. Behavior 48 271-291.
12. Hassin, R. 1995. Decentralized regulation of a queue. Management Sci. 41 163-173.
13. Hassin, R., M. Haviv. 1995. Equilibrium strategies for queues with impatient customers. Oper. Res. Lett. 17 41-45.
14. Hassin, R., M. Haviv. 2002. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, Kluwer Academic Publishers, Boston, MA.
15. Jehiel, P., B. Moldovanu. 2001. Efficient design with interdependent valuations. Econometrica 69 1237-1259.
16. Kittsteiner, T., B. Moldovanu. 2003. Auction-based queue disciplines. Working paper, University of Bonn, Bonn, Germany.
17. Kleinrock, L. 1967. Optimal bribing for queue positions. Oper. Res. 15 304-318.
18. Lui, F. 1985. An equilibrium queueing model of bribery. J. Political Econom. 93 760-781.
19. McAfee, R. P. 1991. Efficient allocation and continuous quantities. J. Econom. Theory 53 51-74.
20. Mendelson, H., S. Whang. 1990. Optimal incentive compatible priority pricing for the M/M/1 queue. Oper. Res. 38 870-883.
21. Naor, P. 1969. The regulation of queue size by levying tolls. Econometrica 37 15-24.
22. Phipps, T. 1956. Machine repair as a priority waiting line problem. Oper. Res. 4 76-85.
23. Ross, S. 1983. Stochastic Processes. John Wiley & Sons, New York.
24. Schrage, L. 1968. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16 687-690.
25. Schrage, L. 1973. Optimal scheduling rules for quadratic waiting costs. Proc. Seventh Annual Princeton Conf. Inform. Sci. Systems, Princeton University, Princeton, NJ, 424-427.
26. Schrage, L., L. Miller. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14 670-684.
27. Tilt, B., K. R. Balachandran. 1979. Stable and superstable customer policies in queues with balking and priority options. Eur. J. Oper. Res. 3 485-498.
28. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3) 808-833.
29. Wilson, B. 1983. Non-Linear Pricing. Oxford University Press, Oxford, U.K.