Comparison of dispatch policies for a single server queueing model with limited operational control

DOI10.1080/00207548408942461zbMath0551.90023OpenAlexW2137322971MaRDI QIDQ3343727

J. George Shanthikumar

Publication date: 1984

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548408942461

zbMATH Keywords

FIFOperiodic reviewfixed batch sizesscheduling within generationssingle machine dynamic job shopsingle server queueing model

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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

On queueing network models of flexible manufacturing systems, On reducing time spent in M/G/1 systems, Design of manufacturing systems using queueing models, The time spent in a dynamic job shop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some analyses on the control of queues using level crossings of regenerative processes
• Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules
• M/G/1 Queues with Scheduling within Generations and Removable Server
• Technical Note—The Queue M/G/1 When Jobs Are Scheduled within Generations
• Utilization of Idle Time in an M/G/1 Queueing System
• The T-Policy for the M/G/1 Queue
• Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
• Optimal Operating Policies for M/G/1 Queuing Systems
• A Priority Rule Based on the Ranking of the Service Times for the M/G/1 Queue
• Some Inequalities in Queuing
• An Exact Comparison of the Waiting Times Under Three Priority Rules