Optimal leadtime differentiation via diffusion approximations

Operations Research

Volumn 52, Issue 2, 2004, Pages 213-228

  Plambeck, Erica L ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Capacity; Diffusion approximations for priority queues; Dynamic leadtime quotation and sequencing in production scheduling; Pricing

Indexed keywords

DIFFUSION APPROXIMATIONS FOR PRIORITY QUEUES; DYNAMIC LEADTIME QUOTATION AND SEQUENCING IN PRODUCTION/SCHEDULING; INCENTIVES; PRICING;

APPROXIMATION THEORY; CONSUMER PRODUCTS; CUSTOMER SATISFACTION; INVESTMENTS; PERSONAL COMPUTERS; PUBLIC POLICY; SALES; SCHEDULING;

INDUSTRIAL ECONOMICS;

EID: 10844281999     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1030.0089     Document Type: Article

References (47)

1. Adiri, I., U. Yechiali. 1974. Optimal priority-purchasing and price decisions in non-monopoly and monopoly queues. Oper. Res. 22 1051-1066.
2. Armony, M., C. Maglaras. 2004. Contact centers with a call-back option and real-time delay information. Oper. Res. Forthcoming.
3. Baker, K. R. 1984. Sequencing rules and due-date assignments in a job shop. Management Sci. 30 1093-1104.
4. Bertrand, J. 1983. The effect of workload dependent due-dates on job shop performance. Management Sci. 29 799-816.
5. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. John Wiley and Sons, New York.
6. Bishop, B. 2000. Private communication with Timbuk2 Director of Operations.
7. Bookbinder, J. H., A. I. Noor. 1985. Setting job-shop due dates with service level constraints. J. Oper. Res. Soc. 36 1017-1026.
8. Browne, S., W. Whitt. 1995. Piecewise-linear diffusion processes. J. H. Dshalalow, ed. Advances in Queueing: Theory, Methods and Open Problems. CRC Press, Boca Rotan, FL, 463-480.
9. Chand, S., D. Chhajed. 1992. A single-machine model for determination of optimal due dates and sequence. Oper. Res. 40 596-602.
10. Dolan, R. J. 1978. Incentive mechanisms for priority queueing problems. Bell J. Econom. 9 421-436.
11. Duenyas, I. 1995. Single facility due date setting with multiple customer classes. Management Sci. 41 608-619.
12. Duenyas, I., W. J. Hopp. 1995. Quoting customer lead times. Management Sci. 41 43-57.
13. Durret, R. 1996. Probability: Theory and Examples. Duxbury Press, Belmont, CA.
14. Economist. 2001. A long march. Mass Customization. Economist 360(8230).
15. Eilon, S., I. G. Chowdhury. 1976. Due dates in job shop scheduling. Internat. J. Production Res. 14 223-237.
16. Ethier, S. N., T. G. Kurtz. 1986. Markov Processes: Characterization and Convergence, 3.5. John Wiley and Sons, New York.
17. Harrison, J. M. 1988. Brownian models of queueing networks with heterogeneous customer populations. W. Fleming, P. L. Lions, eds. Stochastic Differential Systems, Stochastic Control Theory and Applications. IMA, Vol. 10. Springer-Verlag, New York, 147-186.
18. Harrison, J. M. 2003. A broader view of Brownian networks. Ann. Appl. Probab. 13 1119-1150.
19. Iglehart, D. L., W. Whitt. 1970. Multiple channel queues in heavy traffic I. Ann. Appl. Probab. 2 150-177.
20. Kapuscinski, R., S. Tayur. 2000. Dynamic capacity reservation in a make-to-order environment. Working paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
21. Keskinocak, P., R. Ravi, S. Tayur. 2001. Scheduling and reliable lead time quotation for orders with availability intervals and lead time sensitive revenues. Management Sci. 47 264-279.
22. Kleinrock, L. 1967. Optimum bribing for queue position. Oper. Res. 15 304-318.
23. Lederer, P. J., L. Li. 1997. Pricing, production, scheduling and delivery-time competition. Oper. Res. 45 407-420.
24. Li, L., Y. S. Lee. 1994. Pricing and delivery-time performance in a competitive environment. Management Sci. 40 633-646.
25. Mac Williams, G. 2001. Lean machine: How Dell fine-tunes its PC pricing to gain edge in a slow market. Wall Street J. (June 8).
26. Maglaras, C., J. Van Mieghem. 2004. Admission and sequencing control under delay constraints with applications to GPS and GLQ. Eur. J. Oper. Res. Forthcoming.
27. Maglaras, C., A. Zeevi. 2003. Pricing and capacity sizing for systems with shared resources. Scaling relations and approximate solutions. Management Sci. 49(8) 1018-1038.
28. Marchand, M. 1974. Priority pricing. Management Sci. 20 1131-1140.
29. Mendelson, H., S. Whang. 1990. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38 870-883.
30. Nagar, V., M. V. Ranjan. 2001. The revenue implications of financial and operational measures of product quality. Accounting Rev. 76 495-513.
31. Perman, S. 2001. Automate or die. Bus. 2.0 (July).
32. Plambeck, E. L. 2002. Incentive compatible and asymptotically optimal dynamic control in a queue with heterogeneous customers. Working paper, Graduate School of Business, Stanford University, Stanford, CA.
33. Plambeck, E. L., A. R. Ward. 2002. Optimal control of high-volume assemble-to-order systems. Working paper, Graduate School of Business, Stanford University, Stanford, CA.
34. Plambeck, E. L., S. Kumar, J. M. Harrison. 2001. A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Systems 39 23-54.
35. Puhalskii, A. 1994. On the invariance principle for the first passage time. Math. Oper. Res. 19 946-954.
36. Rao, S., E. R. Petersen. 1998. Optimal pricing of priority services. Oper. Res. 46 46-56.
37. Rubino, M. 2003. Flexible server systems with abandonment: A heavy traffic analysis of scheduling and admission control. Ph.D. thesis, Management Science and Engineering Department, Stanford University, Stanford, CA.
38. Seidman, A., M. Smith. 1981. Due dates assignment for production systems. Management Sci. 27 571-581.
39. So, K. C., J.-S. Song. 1998. Price, delivery time guarantees and capacity selection. Eur. J. Oper. Res. 111 28-49.
40. Van Mieghem, J. 2000. Price and service discrimination in queueing systems: Incentive compatibility of Gcμ scheduling. Management Sci. 46 1249-1267.
41. Ward, A. R., P. W. Glynn. 2003a. A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43 103-128.
42. Ward, A. R., P. W. Glynn. 2003b. Properties of the reflected Ornstein-Uhlenbeck process. Queueing Systems 44 109-123.
43. Weeks, J. K. 1979. A simulation study of predictable due dates. Management Sci. 25 363-374.
44. Wein, L. M. 1991. Due date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. 37 834-880.
45. Wein, L. M., P. Chevalier. 1992. A broader view of the job-shop scheduling problem. Management Sci. 38 1018-1033.
46. Whitt, W. 1999. Using different response-time requirements to smooth time-varying demand for services. Oper. Res. Lett. 24 1-10.
47. Wilson, R. B. 1993. Nonlinear Pricing. Oxford University Press, Oxford, U.K.