https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Oosterwijk_2018aOosterwijk 2018a - Revision history2026-04-18T18:35:17ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Oosterwijk_2018a&diff=190372&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 236972791 to Oosterwijk 2018a2021-01-26T16:32:47Z<p>Scipediacontent moved page <a href="/public/Draft_Content_236972791" class="mw-redirect" title="Draft Content 236972791">Draft Content 236972791</a> to <a href="/public/Oosterwijk_2018a" title="Oosterwijk 2018a">Oosterwijk 2018a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 16:32, 26 January 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Oosterwijk_2018a&diff=190371&oldid=prevScipediacontent: Created page with " == Abstract == This dissertation examines four optimisation problems. The first chapter examines the optimisation of network usage to prevent traffic congestion and internet..."2021-01-26T16:32:41Z<p>Created page with " == Abstract == This dissertation examines four optimisation problems. The first chapter examines the optimisation of network usage to prevent traffic congestion and internet..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This dissertation examines four optimisation problems. The first chapter examines the optimisation of network usage to prevent traffic congestion and internet data issues. The second chapter describes cyclical production planning for machines, such as those used to process huge volumes of lycra. In the third chapter, tasks that involve several components (such as processing time and memory use) are planned on computers so that no single computer is overloaded. The fourth chapter describes strategies for hiring highly skilled employees and strategies to increase the profit margins of a product. A theoretical lower limit is defined for the complexity of each problem and an algorithm is developed to approach this lower limit.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.26481/dis.20180119to http://dx.doi.org/10.26481/dis.20180119to]<br />
<br />
* [https://cris.maastrichtuniversity.nl/en/publications/9ebedbe9-ee84-42ff-be31-11414a5e11dd https://cris.maastrichtuniversity.nl/en/publications/9ebedbe9-ee84-42ff-be31-11414a5e11dd]<br />
<br />
* [https://cris.maastrichtuniversity.nl/portal/files/18377541/c5913.pdf https://cris.maastrichtuniversity.nl/portal/files/18377541/c5913.pdf]<br />
<br />
* [https://cris.maastrichtuniversity.nl/en/publications/approximation-algorithms-in-allocation-scheduling-and-pricing https://cris.maastrichtuniversity.nl/en/publications/approximation-algorithms-in-allocation-scheduling-and-pricing],<br />
: [https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F9ebedbe9-ee84-42ff-be31-11414a5e11dd https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F9ebedbe9-ee84-42ff-be31-11414a5e11dd],<br />
: [https://cris.maastrichtuniversity.nl/ws/files/18377541/c5913.pdf https://cris.maastrichtuniversity.nl/ws/files/18377541/c5913.pdf],<br />
: [https://academic.microsoft.com/#/detail/2771222084 https://academic.microsoft.com/#/detail/2771222084]</div>Scipediacontent