| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Algorithms.MDP.Examples.MM1
Description
We model an MM1 queue, i.e. a single-server queue with Poisson arrivals and service times.
See "Stochastic Dynamic Programming and the Control of Queueing Systems", Linn I. Sennot,, p. 242 for details.
- data Scenario = Scenario {
- _arrivalRate :: Double
- _serviceRates :: [Double]
- _serviceCosts :: [Double]
- _holdingCosts :: Int -> Double
- _maxWaiting :: Int
- _scenarioCost :: Double
- newtype State = State Int
- data Action
- = NullAction
- | Action Int
- mkInstance :: Scenario -> CTMDP State Action Double
- scenario1 :: Scenario
- scenario2 :: Scenario
- scenario3 :: Scenario
- scenario4 :: Scenario
- scenario5 :: Scenario
- scenario6 :: Scenario
- scenario7 :: Scenario
- scenario8 :: Scenario
Documentation
A description of an MDP.
Constructors
| Scenario | |
Fields
| |
The state space is the count of customers in the queue.
There are a number of services we can provide each customer, and if there are no customers we do nothing.
Constructors
| NullAction | |
| Action Int |