This project focuses on the problem of making appointments for jobs to arrive at a queue. We have to determine both the time scheduled before the next job arrives, and also the sequence in which different jobs should arrive. This should be done in such a way that there is both little waiting time for the jobs and little idle time in the queue, between which there is a trade-off. To this end, both knowledge in queueing theory and optimalisation will be needed.
|Madelon de Kemp
|University of Amsterdam (UvA)