Heuristic procedures for a stochastic batch service problem
From MaRDI portal
Publication:742503
DOI10.1007/s10288-014-0254-7zbMath1297.90066OpenAlexW2048741698MaRDI QIDQ742503
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
monotonicityMarkov decision processvalue iterationheuristic proceduresmulti-class batch service problem
Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)
Related Items (1)
Cites Work
- Unnamed Item
- Building cyclic master surgery schedules with leveled resulting bed occupancy
- Optimal control of batch service queues with finite service capacity and linear holding costs
- Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
- Monotonicity in multidimensional Markov decision processes for the batch dispatch problem
- An elective surgery scheduling problem considering patient priority
- Distribution Strategies that Minimize Transportation and Inventory Costs
- The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure
- The Computation of Optimal Control Limits for a Queue with Batch Services
- Minimizing Transportation and Inventory Costs for Several Products on a Single Link
- Reservation Planning for Elective Surgery Under Uncertain Demand for Emergency Surgery
- An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
- Optimal control of batch service queues
- An algorithm for optimal shipments with given frequencies
This page was built for publication: Heuristic procedures for a stochastic batch service problem