In this master s thesis we mainly want to examine online queue management system what happens when in this situation a queue with reservation places is chosen, and how the performance of that waiting discipline can change by adjusting various parameters. Short, the characteristics of this system will be further investigated in this master s thesis. To determine these results, a simulation program is written that can generate the data needed to investigate the different characteristics that we wish to investigate. This program should simulate the arrival process, the queue and the operating process. For these three parts of the simulation program, different parameters can be entered to simulate a particular situation as well as possible.
Parameters are also modified for the latter four sub customer queue management system studies to simulate different arrival processes and waiting areas. In a final part, the delay quantity are discussed. In this master s thesis, a simulation of a system with train tickets is executed and discussed with priority on the basis of reservation locations. Order to be able to carry out such a simulation, a simulation program must be programmed. A first important characteristic of this simulation program will be working with discrete time, practically this means that we work with time slots. In contrast to when we work with a continuous time division, in a discrete time division the time can not be split up further into smaller sub intervals than one time slot. Working with time slots is useful in the simulation program because in this way the see here length of the simulation can be expressed in the number of time slots, and we can define exactly what happens in such a time slot. Working with discrete time also has practical applications, let us think of the examples that were given in the introduction to this master s thesis. The distinction between a continuous and a discrete time division is made clear again by the attached s. The simulation program consists of three main parts the arrival process, the queue, and the way in which the arriving packages are placed in the queue, and the operating process. It is clear that the processes of these components will have to be performed many times by the simulation program. In every time slot, arrivals, the operating process and packages that are put in the queue will be simulated.