Due-date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules

Operations Research

Volumn 51, Issue 1, 2003, Pages

  Van Mieghem, Jan A ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Inventory production, policies, review lead times: production policies to guarantee lead times; Production scheduling, sequencing, stochastic: lead time constrained scheduling; Queues, optimization: optimal control to meet due dates or lead times

Indexed keywords

LEAD-TIMES; PRODUCTION POLICIES; STOCHASTIC MODELS;

CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; PROBLEM SOLVING; PUBLIC POLICY; QUEUEING THEORY; SCHEDULING;

OPERATIONS RESEARCH;

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

References (16)

1. Ayhan H., T. L. Olsen. 2000. Scheduling of a multi-class single-server queue under non-traditional performance measures. Oper. Res. 48(3) 482-289.
2. Bertsimas, D., I. C. Paschalidis, J. N. Tsitsiklis. 1998. Asymptotic buffer overflow probabilities in multiclass multiplexers: An optimal control approach. IEEE Trans. Automatic Control 43(3) 315-335.
3. Bramson, M. 1998. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30 89-148.
4. Cohen, J. 1987. A two queue, one server model with priority for the longer queue. Queueing Systems 2 261-284.
5. Doytchinov, B., J. Lehoczky, S. Shreve. 2001. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11(2) 332-378.
6. Maglaras, C., J. A. Van Mieghem. 2001. Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control. Working paper, Northwestern University, Evanston, IL.
7. Markowitz, D. M., L. M. Wein. 2001. Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Oper. Res. 49(2) 246-270.
8. Plambeck, E., S. Kumar, J. M. Harrison. 2001. Asymptotic optimality of a single server queueing system with constraints on throughput times. Queueing Systems 39 23-54.
9. Sethuraman, J. 1999. Scheduling job shops and multiclass queueing networks using fluid and semidefinite relaxations. Ph.D. thesis, MIT, Cambridge, MA.
10. Stolyar, A. 2002. Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality. Ann. Appl. Probab. Forthcoming.
11. _, K. Ramanan. 2001. Largest weighted delay first scheduling: Large deviations and optimality. Ann. Appl. Probab. 11(1) 1-48.
12. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ, rule. Ann. Appl. Probab. 5(3) 809-833.
13. _. 2000. Price and service discrimination in queueing systems: Incentive compatibility of Gcμ scheduling. Management Sci. 46(9) 1249-1267.
14. Wein, L. M. 1991. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. 37(7) 834-850.
15. Williams, R. 1998. Diffusion approximations for open multiclass queuing networks: Sufficient conditions involving state space collapse. Queueing Systems 30 27-88.
16. Zipkin, P. H. 1995. Performance analysis of a multi-item production-inventory system. Management. Sci. 41(4) 690-703.