On reducing time spent in M/G/1 systems

DOI10.1016/0377-2217(82)90037-6zbMath0475.60083OpenAlexW2141984584MaRDI QIDQ1159410

J. George Shanthikumar

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90037-6

zbMATH Keywords

shortest processing timescheduling discipline

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

On queueing network models of flexible manufacturing systems ⋮ Design of manufacturing systems using queueing models ⋮ The time spent in a dynamic job shop

Cites Work

• Unnamed Item
• Unnamed Item
• The time spent in a dynamic job shop
• Public and private optimization at a service facility with approximate information on congestion
• Optimization of stochastic maintenance policies
• An approach to nonlinear programming
• Comparison of dispatch policies for a single server queueing model with limited operational control
• ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE
• Probabilistic priorities in the M/G/1 queue
• Minimization of Time-Varying Costs in Single-Machine Scheduling
• A Simple Method for Reducing Queuing Times in M/G/1
• Priority Assignment in Waiting Line Problems
• Machine Repair as a Priority Waiting-Line Problem
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Priority Queues
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: On reducing time spent in M/G/1 systems