Bart van MerriĆ«nboer edited Problem description.tex  over 10 years ago

Commit id: 111483b882fd5a3baecf6cc12da3e8300dcf5747

deletions | additions      

       

\item default  \end{itemize}  These jobs have pre-determined processing times, which are distributed according to some general distribution $G$. $G$ (see figures). Three corresponding types of VMs can be started to process these jobs, where VM running costs are charged in hourly increments.     \[   C(t) = \max \(\{0, \lceil \frac{t}{3600}\rceil \} \)   \]     The arrivals are most likely Markovian and obey a Poisson process. However, the workload depends on the time of day which makes the