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

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

Katerina P. Papadaki, Warren B. Powell

Publication date: 17 November 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00297-1

zbMATH Keywords

Dynamic programmingInventory theory

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (13)

Analysis of batched service time data using Gaussian and semi-parametric kernel models ⋮ A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times ⋮ Monotonicity in multidimensional Markov decision processes for the batch dispatch problem ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ Fitting piecewise linear continuous functions ⋮ Approximate dynamic programming for link scheduling in wireless mesh networks ⋮ Shape constraints in economics and operations research ⋮ Shipment consolidation with two demand classes: rationing the dispatch capacity ⋮ Scheduling services in a queuing system with impatience and setup costs ⋮ Optimal production and inventory rationing policies with selective-information sharing and two demand classes ⋮ An Approximate Dynamic Programming Algorithm for Monotone Value Functions ⋮ Heuristic procedures for a stochastic batch service problem ⋮ The single-node dynamic service scheduling and dispatching problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 logistic costs in multistage supply chains
• 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
• An algorithm for optimal shipments with given frequencies

This page was built for publication: Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem