Skip to main content
SpringerLink
Log in

Scheduling in Multiclass Networks with Deterministic Service Times

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider general feed-forward networks of queues with deterministic service times and arbitrary arrival processes. There are holding costs at each queue, idling may or may not be permitted, and servers may fail. We partially characterize the optimal policy and give conditions under which lower priority should be given to jobs that would be delayed later in the network if they were processed now.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Bramson, Instability of FIFO queueing networks, Ann. Appl. Probab. 6 (1996) 414-431.

    Google Scholar 

  2. C. Buyukkoc, P. Varaiya and J. Walrand, The cµ rule revisited, Adv. in Appl. Probab. 17 (1985) 237-238.

    Google Scholar 

  3. H. Chen, P. Yang and D. Yao, Control and scheduling in a two-station queueing network: Optimal policies and heuristics, Queueing Systems 18 (1994) 301-332.

    Google Scholar 

  4. R. Hariharan, M.S. Moustafa and S. Stidham, Jr., Scheduling in a multiclass series of queues with deterministic service times, Queueing Systems 24 (1996) 83-99.

    Google Scholar 

  5. J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations, in: Stochastic Differential Systems, Stochastic Control Theory and Applications, eds. W. Fleming and P.L. Lion (Springer, New York, 1988) pp. 147-186.

    Google Scholar 

  6. J.M. Harrison and L.M. Wein, Scheduling networks of queues: Heavy-traffic analysis of a simple open network, Queueing Systems 5 (1989) 265-280.

    Google Scholar 

  7. A. Hordijk and G. Koole, The µc-rule is not optimal in the second node of the tandem queue; a counterexample, Adv. in Appl. Probab. 24 (1992) 234-237.

    Google Scholar 

  8. G.P. Klimov, Time-sharing service systems. I, Theory Probab. Appl. 19 (1974) 532-551.

    Google Scholar 

  9. G.P. Klimov, Time-sharing service systems. II, Theory Probab. Appl. 23 (1978) 314-321.

    Google Scholar 

  10. P.R. Kumar, A tutorial on some new methods for performance evaluation of queueing networks, IEEE J. Selected Areas Comm. 13 (1995) 970-980.

    Google Scholar 

  11. P.R. Kumar and T.I. Seidman, Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems, IEEE Trans. Automat. Control 35 (1990) 289-298.

    Google Scholar 

  12. S.C.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (1991) 1406-1416.

    Google Scholar 

  13. M.S. Moustafa, Scheduling in a multiclass network, Ph.D. dissertation, Program in Operations Research, North Carolina State University, Raleigh (1987).

    Google Scholar 

  14. T.I. Seidman, First come first serve can be unstable, IEEE Trans. Automat. Control 39 (1994) 2166-2170.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA, 95053, USA

    Rhonda Righter

Authors
  1. Rhonda Righter
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Righter, R. Scheduling in Multiclass Networks with Deterministic Service Times. Queueing Systems 41, 305–319 (2002). https://doi.org/10.1023/A:1016241214158

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016241214158

Search

Navigation