Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules

@article{Mieghem2003DueDateSA,
  title={Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules},
  author={Jan A. Van Mieghem},
  journal={Operations Research},
  year={2003},
  volume={51},
  pages={113-122}
}
Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due date t+Dk. Equivalently, its delay k must not exceed a given delay or lead-time Dk. In a stochastic system, the constraint k Dk must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, however, the associated optimal control problem is intractable with exact analysis. This article… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
24 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Asymptotic optimality of a single server queueing system with constraints on throughput times

  • E. Plambeck, S. Kumar, J. M. Harrison.
  • Queueing Systems 39 23–54.
  • 2001
Highly Influential
4 Excerpts

Real-time queues in heavy traffic with earliest-deadline-first queue discipline

  • B. Doytchinov, J. Lehoczky, S. Shreve.
  • Ann. Appl. Probab. 11(2) 332–378.
  • 2001
2 Excerpts

Scheduling job shops and multiclass queueing networks using fluid and semidefinite relaxations

  • J. Sethuraman
  • Ph.D. thesis, MIT, Cambridge, MA.
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…