Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem

DOI10.1016/S0377-2217(01)00297-1zbMath1081.90605MaRDI QIDQ1847251

Warren B. Powell, Katerina P. Papadaki

Publication date: 17 November 2002

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

zbMATH Keywords

Dynamic programming; Inventory theory

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B05: Inventory, storage, reservoirs

90C39: Dynamic programming

Related Items

Scheduling services in a queuing system with impatience and setup costs, Fitting piecewise linear continuous functions, Heuristic procedures for a stochastic batch service problem, Approximate dynamic programming for link scheduling in wireless mesh networks, The single-node dynamic service scheduling and dispatching problem, Monotonicity in multidimensional Markov decision processes for the batch dispatch problem, An Approximate Dynamic Programming Algorithm for Monotone Value Functions

Cites Work

• Optimal control of diffusion processes with reflection
• The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure
• Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal
• Optimal Dispatching of a Finite Capacity Shuttle
• Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal
• On operating a shuttle service
• Optimal control of batch service queues with switching costs
• Minimizing Transportation and Inventory Costs for Several Products on a Single Link
• Optimal Average Cost Policies for the Two-Terminal Shuttle
• A General Class of Bulk Queues with Poisson Input
• Optimal control of batch service queues
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item