Some finite horizon dispatching problems
Brill, Edward A.
MetadataShow full item record
An arrival process (N(t), 0 = or t = or T) is to be dispatched one or more times in the time interval (0,T). The problem is to determine the optimal number of dispatches K given there are n available and to determine sequentially the epochs of dispatch tau sub 1, ..., tau sub K. There are two trade off costs c sub w and c sub d, which are respectively the cost per unit time of a waiting customer and the cost of dispatching a single unit. A general result is found which gives one optimal tau sub 1, ..., tau sub K for fixed K (i.e. the K-optimal policy) under certain regularity conditions. This is used to obtain suboptimal policies for multiple dispatching of a Poisson process and single dispatching of a birth-death process. Applications to problems in transportation, repair facilities and insect-control are indicated. (Author)
NPS Report NumberNPS55ZG71061A
Showing items related by title, author, creator and subject.
Walsh, Thomas Michael (Monterey, California: Naval Postgraduate School, 2014-12);Given that public safety answering points (PSAPs or 9-1-1 dispatch centers) are undergoing a process of consolidation, should that consolidation occur as a function of simple geographic proximity or discipline? This thesis ...
Maalouf, Maher; MacKenzie, Cameron A.; Radakrishnan, Sridhar; Court, Mary (2014);Almost all Dial-a-Ride problems (DARP) described in the literature pertain to the design of optimal routes and schedules for n customers who specify pick-up and drop-off times. In this article we assume that the customer ...
Usefulness of compile-time restructuring of large grain data flow programs in throughput-critical applications Cross, David M. (Monterey, California. Naval Postgraduate School, 1993-09);In this thesis, Large Grain Data Flow (LGDF) representation of parallelism is applied to throughout-critical applications that process periodically arriving data. The applications are represented by directed acyclic graphs ...