booktest.tex

\documentclass{book}
\usepackage{classicthesis}
%\documentclass[a4paper,12pt]{report}
%\documentclass[a4paper,11pt]{book}
%\documentclass[a4paper,11pt]{scrbook}

%^\newif\ifFilterExercises

%\FilterExercisestrue
%\FilterExercisesfalse


% \ifFilterExercises
% \usepackage[solutionfiles]{optional}
% \else
% %\usepackage[solutionfiles]{optional}
% \usepackage[nosolutionfiles]{optional}
% \fi

\usepackage[solutionfiles]{optional}
%\usepackage[nosolutionfiles]{optional}

\opt{nosolutionfiles}{\usepackage[nosolutionfiles]{answers}}
\opt{solutionfiles}{\usepackage{answers}}

\usepackage{preamble_test}

% handle indentation below figure captions
%\setcapwidth[c]{.8\textwidth}
% \setcapwidth{0.95\textwidth}
% \setcapindent{0pt}
%\addtokomafont{caption}{\centering}

% include  book references
\usepackage{xr-hyper}
\externaldocument{book}

\title{Formulas for Queueing Theory and Simulation}

\makeindex
\begin{document}

\frontmatter
\maketitle

\input{henk}

\end{document}

\tableofcontents

% \ifFilterExercises
% \Opensolutionfile{exercises}
% \fi

\chapter{Introduction}\label{sec:introduction}
\Opensolutionfile{jaap}

%\include{organization}
%\input{tex_files/intro.tex}
%\input{tex_files/preliminaries.tex}

\mainmatter
\chapter{Single-Station Queueing Systems}

\chapter{Construction and Simulation of Queueing Systems}
\label{cha:single-stat-queu}

In this chapter we start with a discussion of the Poisson process.
We then construct queueing processes in discrete time and apply the Poisson process to model the number of arrivals in periods of fixed length.
In Section~\ref{sec:expon-distr} we relate the exponential distribution to the Poisson distribution.
The exponential distribution often serves as a good model for inter-arrival times of individual jobs.
As such this is a key component of the construction of queueing processes in continuous time.
As it turns out, both ways to construct queueing processes are easily implemented as computer programs, thereby allowing us to use simulation to analyze queueing systems.
In passing we develop a number of performance measures to provide insight into the (transient and average) behavior of queueing processes.

We assume that you  \emph{know all} results of Section~\ref{sec:preliminaries}. 

%\input{tex_files/preliminaries.tex}

\input{tex_files/poissondistribution.tex}
% \input{tex_files/constructiondiscretetime.tex}
%\input{tex_files/expdistribution.tex}
%\input{tex_files/constructioncontinuoustime.tex}
%\input{tex_files/failures.tex}
%\input{tex_files/adjustments.tex}
%\input{tex_files/setup_times.tex}
%\input{tex_files/random_walk.tex}
%\input{tex_files/ratestability.tex}
%\input{tex_files/renewal_reward.tex}
% \input{tex_files/empericalperfmeasures.tex}
%\input{tex_files/levelcrossing.tex}
% \input{tex_files/kendall.tex}
% \input{tex_files/mm1.tex}
%\input{tex_files/mnmn1.tex}
% \input{tex_files/pasta.tex}
%\input{tex_files/little.tex}
%\input{tex_files/usefulidentities.tex}
%\input{tex_files/mxm1_pk.tex}
%\input{tex_files/mg1.tex}
%\input{tex_files/batcharrivals.tex}
%\input{tex_files/mg1distributionqueuelength.tex}
%\input{tex_files/setup_times.tex}
%\input{tex_files/adjustments.tex}
%\input{tex_files/failures.tex}
%\input{tex_files/deterministic_networks.tex}
%\input{tex_files/formula_sheet}
%\input{tex_files/open_single_class.tex}
%\input{tex_files/gordon_newell.tex}

\Closesolutionfile{jaap}
%\input{jaap}

% \ifFilterExercises
% \Closesolutionfile{exercises}
% \fi



\backmatter
% \cleardoublepage

%\addcontentsline{toc}{chapter}{Index}
\chapter{Index}
%\phantomsection
\printindex

% \bibliographystyle{plainnat}
% \bibliography{biblio_nicky}
\end{document}

%%% Local Variables:
%%% mode: latex
%%% TeX-master: t
%%% End: