Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal

DOI10.1287/OPRE.22.5.1008MaRDI QIDQ4051902zbMATH OpenOpenAlexFDO

Authors E. Ignall, Peter J. Kolesar

Publication date 1974

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.22.5.1008

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Quadratic programming (90C20)

Cited in

(9)

• Mathematical analysis of a shuttle system based on two interdependent queues
• Optimal dispatching of an infinite capacity shuttle with compound Poisson arrivals: Control at a single terminal
• Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
• Optimal control for parallel queues with a single batch server
• A simple policy for multiple queues with size-independent service times
• Some Optimization Problems with Bulk-Service Queues
• Mathematical analysis of a two-shuttle transportation system
• Cyclic systems with a service delay
• The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals

This page was built for publication: Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051902)