IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v142y2002i1p108-127.html
   My bibliography  Save this article

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

Author

Listed:
  • Papadaki, Katerina P.
  • Powell, Warren B.

Abstract

No abstract is available for this item.

Suggested Citation

  • Papadaki, Katerina P. & Powell, Warren B., 2002. "Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 108-127, October.
    • Handle: RePEc:eee:ejores:v:142:y:2002:i:1:p:108-127
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00297-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Howard J. Weiss & Stanley R. Pliska, 1976. "Optimal Control of Some Markov Processes with Applications to Batch Queueing and Continuous Review Inventory Systems," Discussion Papers 214, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Edward Ignall & Peter Kolesar, 1972. "Operating Characteristics of a Simple Shuttle under Local Dispatching Rules," Operations Research, INFORMS, vol. 20(6), pages 1077-1088, December.
    3. Rajat K. Deb, 1978. "Optimal Dispatching of a Finite Capacity Shuttle," Management Science, INFORMS, vol. 24(13), pages 1362-1372, September.
    4. Warren B. Powell & Pierre Humblet, 1986. "The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure," Operations Research, INFORMS, vol. 34(2), pages 267-275, April.
    5. Bertazzi, Luca & Grazia Speranza, Maria, 1999. "Inventory control on sequences of links with given transportation frequencies," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 261-270, March.
    6. Warren B. Powell, 1985. "Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues," Transportation Science, INFORMS, vol. 19(4), pages 352-377, November.
    7. Rajat K. Deb & Charles P. Schmidt, 1987. "Optimal Average Cost Policies for the Two-Terminal Shuttle," Management Science, INFORMS, vol. 33(5), pages 662-669, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    2. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    3. Satır, Benhür & Erenay, Fatih Safa & Bookbinder, James H., 2018. "Shipment consolidation with two demand classes: Rationing the dispatch capacity," European Journal of Operational Research, Elsevier, vol. 270(1), pages 171-184.
    4. Yongpei Guan & Andrew J. Miller, 2008. "Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 56(5), pages 1172-1183, October.
    5. Sumit Kunnumkal & Huseyin Topaloglu, 2008. "Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 288-301, May.
    6. Wang, Yi & Zhang, Sheng Hao, 2021. "Optimal production and inventory rationing policies with selective-information sharing and two demand classes," European Journal of Operational Research, Elsevier, vol. 288(2), pages 394-407.
    7. Daniel R. Jiang & Warren B. Powell, 2015. "An Approximate Dynamic Programming Algorithm for Monotone Value Functions," Operations Research, INFORMS, vol. 63(6), pages 1489-1511, December.
    8. Toriello, Alejandro & Vielma, Juan Pablo, 2012. "Fitting piecewise linear continuous functions," European Journal of Operational Research, Elsevier, vol. 219(1), pages 86-95.
    9. Yoshiaki Inoue, 2022. "A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 449-451, April.
    10. Ulmer, Marlin W. & Thomas, Barrett W., 2020. "Meso-parametric value function approximation for dynamic customer acceptances in delivery routing," European Journal of Operational Research, Elsevier, vol. 285(1), pages 183-195.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Katerina P. Papadaki & Warren B. Powell, 2003. "An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 742-769, October.
    2. Hall, Randolph W. & Sabnani, Vikas C., 2002. "Control of vehicle dispatching on a cyclic route serving trucking terminals," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(3), pages 257-276, March.
    3. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    4. M. A. A. Boon & A. J. E. M. Janssen & J. S. H. Leeuwaarden & R. W. Timmerman, 2019. "Pollaczek contour integrals for the fixed-cycle traffic-light queue," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 89-111, February.
    5. Çetinkaya, SIla & Bookbinder, James H., 2003. "Stochastic models for the dispatch of consolidated shipments," Transportation Research Part B: Methodological, Elsevier, vol. 37(8), pages 747-768, September.
    6. Song, Dong-Ping & Earl, Christopher F., 2008. "Optimal empty vehicle repositioning and fleet-sizing for two-depot service systems," European Journal of Operational Research, Elsevier, vol. 185(2), pages 760-777, March.
    7. Warren B. Powell, 1987. "Waiting‐time distributions for bulk arrival, bulk service queues with vehicle‐holding and cancellation strategies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 207-227, April.
    8. Le-Duc, T. & de Koster, M.B.M., 2002. "Determining The Optimal Order Picking Batch Size In Single Aisle Warehouses," ERIM Report Series Research in Management ERS-2002-64-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Sergei Dudin & Olga Dudina, 2023. "Analysis of a Multi-Server Queue with Group Service and Service Time Dependent on the Size of a Group as a Model of a Delivery System," Mathematics, MDPI, vol. 11(22), pages 1-20, November.
    10. Pan, Zhendong & Tang, Jiafu & Fung, Richard Y.K., 2009. "Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure," European Journal of Operational Research, Elsevier, vol. 192(3), pages 824-836, February.
    11. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    12. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    13. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "Acceptance and Dispatching Policies for a Distribution Problem," Transportation Science, INFORMS, vol. 32(2), pages 127-141, May.
    14. Yi, Xeung W. & Kim, Nam K. & Yoon, Bong K. & Chae, Kyung C., 2007. "Analysis of the queue-length distribution for the discrete-time batch-service Geo/Ga,Y/1/K queue," European Journal of Operational Research, Elsevier, vol. 181(2), pages 787-792, September.
    15. Xu, Jianjun & Serrano, Alejandro & Lin, Bing, 2017. "Optimal production and rationing policy of two-stage tandem production system," International Journal of Production Economics, Elsevier, vol. 185(C), pages 100-112.
    16. Apoorv Saxena & Dieter Claeys & Bo Zhang & Joris Walraevens, 2020. "Cloud data storage: a queueing model with thresholds," Annals of Operations Research, Springer, vol. 293(1), pages 295-315, October.
    17. Menachem Berg & Frank van der Duyn Schouten & Jorg Jansen, 1998. "Optimal Batch Provisioning to Customers Subject to a Delay-Limit," Management Science, INFORMS, vol. 44(5), pages 684-697, May.
    18. K. Sikdar & S. K. Samanta, 2016. "Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server’s vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 553-583, September.
    19. Dieter Claeys & Koenraad Laevens & Joris Walraevens & Herwig Bruneel, 2010. "Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(1), pages 1-23, August.
    20. Nam K. Kim & Kyung C. Chae & Mohan L. Chaudhry, 2004. "An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions," Operations Research, INFORMS, vol. 52(5), pages 756-764, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:142:y:2002:i:1:p:108-127. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.