Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem-Reference-Cited by-同舟云学术

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

Published:2002-10 Issue:1 Volume:142 Page:108-127
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Papadaki Katerina P.,Powell Warren B.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. On queueing processes with bulk service;Bailey;Journal of the Royal Statistical Society B,1954

2. On operating a shuttle service;Barnett;Networks,1973

3. Inventory control on sequences of links with given transportation frequencies;Bertazzi;International Journal of Production Economics,1999

4. Minimizing logistic costs in multistage supply chains;Bertazzi;Naval Research Logistics,1999

5. Bertazzi, L., Bertsekas, D., Speranza, M.G., 2000. Optimal and neuro-dynamic programming solutions for a stochastic inventory trasportation problem, Unpublished Technical Report, Universita Degli Studi Di Brescia

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Alternating Suboptimal Dynamic Programming Algorithm with Applications for Feature Selection;Mathematics;2024-06-27

2. Managing priorities on on-demand service platforms with waiting time differentiation;International Journal of Production Economics;2023-12

3. SMDP-Based Dynamic Batching for Efficient Inference on GPU-Based Platforms;ICC 2023 - IEEE International Conference on Communications;2023-05-28

4. State‐dependent Problems;Reinforcement Learning and Stochastic Optimization;2022-04-02

5. A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times;Queueing Systems;2022-04