Heuristic procedures for a stochastic batch service problem
DOI10.1007/S10288-014-0254-7zbMATH Open1297.90066OpenAlexW2048741698MaRDI QIDQ742503FDOQ742503
Authors: Daiki Min
Publication date: 18 September 2014
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0254-7
Recommendations
- Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
- scientific article; zbMATH DE number 2050724
- Optimal batch provisioning to customers subject to a delay-limit
- scientific article; zbMATH DE number 65357
- A stochastic batching and scheduling problem
monotonicityMarkov decision processvalue iterationheuristic proceduresmulti-class batch service problem
Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure
- Building cyclic master surgery schedules with leveled resulting bed occupancy
- An elective surgery scheduling problem considering patient priority
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Reservation Planning for Elective Surgery Under Uncertain Demand for Emergency Surgery
- Minimizing Transportation and Inventory Costs for Several Products on a Single Link
- Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
- The Computation of Optimal Control Limits for a Queue with Batch Services
- Optimal control of batch service queues
- An algorithm for optimal shipments with given frequencies
- Optimal control of batch service queues with finite service capacity and linear holding costs
- Monotonicity in multidimensional Markov decision processes for the batch dispatch problem
- An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
Cited In (6)
- Shipment consolidation with two demand classes: rationing the dispatch capacity
- Optimal batch provisioning to customers subject to a delay-limit
- Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
- A heuristic approach to the overnight security service problem
- The stochastic single resource service-provision problem
- Title not available (Why is that?)
This page was built for publication: Heuristic procedures for a stochastic batch service problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742503)