Optimal Leadtime Differentiation via Diffusion Approximations

References

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