Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service

Journal of the ACM (JACM)

Volumn 35, Issue 4, 1988, Pages 832-844

  Panwar, Shivendra S ^a   Towsley, Don ^b   Wolf, Jack K ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Control of Queues; Markov decision processes; packetized voice communications; queues with impatient customers; stochastic scheduling theory

Indexed keywords

COMPUTER NETWORKS - LOCAL NETWORKS; OPTIMIZATION; SCHEDULING; TELECOMMUNICATION;

CUSTOMER DEADLINES; OPTIMAL SCHEDULING POLICIES; PACKETIZED VOICE COMMUNICATIONS; STOCHASTIC SCHEDULING;

PROBABILITY;

EID: 0024090155     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/48014.48019     Document Type: Article

References (14)

1. Baccelli, F., and Hebuterne, G. On queues with impatient customers. In Performance '81, F. J. Klystra, Ed. North Holland, Amsterdam, 1981, pp. 159–179.
2. Dertouzos, M. Control robotics: The procedural control of physical processes. In Proceedings of the IFIP Congress, 1974, pp. 807–813.
3. Gold, B. Digital speech networks. Proc. IEEE 65 (Dec. 1977), 1636-1658.
4. Gross, D., and Harris, M. T. Fundamentals of Queueing Theory. Wiley, New York, 1974.
5. Gruber, J. G., and Le, N. H. Performance requirements for integrated voice/data networks. IEEE J. Selected Areas Commun. SAC-1, 6 (Dec. 1983), 981-1005.
6. Howard, R. Dynamic Programming and Markov Processes. M.I.T. Press, Cambridge, Mass., 1960.
7. Jackson, J. R. Scheduling a production line to minimize maximum tardiness. Res. Rep. 43, Management Sci. Rep., Univ. of Calif, Los Angeles, 1955.
8. Kleinrock, L. Queueing Systems Volume II: Computer Applications. Wiley, New York, 1976.
9. Moore, J. M. Ann job, one machine sequencing algorithm for minimizing the number of late jobs. Manage. Sci. 15 (1968), 102-109.
10. Panwar, S. S. Time constrained and multiaccess communications. Ph.D. dissertation. Dept. of Electrical and Computer Electrical Engineering, Univ. of Massachusetts, Amherst, Feb. 1986.
11. Pierskalla, W. P., and Roach, C. Optimal issuing policies for perishable inventory. Manage. Sci. 18 (1972), 603-614.
12. Pinedo, M. Stochastic scheduling with release dates and due dates. Oper. Res. 31 (1983), 559-572.
13. Schwartz, M. Telecommunication Networks: Protocols, Modeling and Analysis. Addison-Wesley, Reading, Mass., 1987.
14. Su, Z.-S., and Sevcik, K. C. A combinatorial approach to scheduling problems. Oper. Res. 26 (1978), 836-844.