Scheduling an international relay-run

Bachelor thesis (2019)

Authors

M.C. van Meerten Electrical Engineering, Mathematics and Computer Science
L. Overdevest Electrical Engineering, Mathematics and Computer Science
J. Nieuwdorp Electrical Engineering, Mathematics and Computer Science

Contributors

M.T.J. Spaan Algorithmics - EEMCS (coach)
H. Wang (supervisor 2)
O.W. Visser Data-Intensive Systems - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2019 Martijn van Meerten, Lennart Overdevest, Jasper Nieuwdorp
Scheduling Greedy Roparun
More Info
expand_more

Published Date

01-02-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Roparun is a Foundation that organizes a yearly relay race from Paris, Hamburg and Almelo to Rotterdam in order to raise money for a variety of causes related to palliative care. They requested for an application that could create the start schedule of the race. In this thesis, the problem is analyzed and a greedy based solution is presented. Furthermore, the process to create the application, and the application's architecture is described.

Files

BEP_Roparun.pdf
(.pdf | 6.05 Mb)