Recent Developments in Prophet Inequalities

Autor: Tim Oosterwijk, Tjark Vredeveld, Patricio Foncea, Ruben Hoeksma, José R. Correa

Publikováno v: Correa, J, Foncea, P, Hoeksma, R, Oosterwijk, T & Vredeveld, T 2019, ' Recent Developments in Prophet Inequalities ', ACM SIGecom Exchanges, vol. 17, no. 1, pp. 61-70 . < http://www.sigecom.org/exchanges/volume_17/1/CORREA.pdf >
Sigecom exchanges, 17(1), 61-70. Association for Computing Machinery
ACM SIGecom Exchanges
ACM SIGecom Exchanges, 17(1), 61-70. ACM

The classic prophet inequality states that, when faced with a finite sequence of non-negative independent random variables, a gambler who knows their distribution and is allowed to stop the sequence at any time, can obtain, in expectation, at least h

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f0c51e12d9f989d7dcffaa01617ad46
https://hdl.handle.net/1871.1/63d0730c-2846-40ff-8fbe-f0e6f0190676

Approximation Algorithms in Allocation, Scheduling and Pricing

Autor: Tim Oosterwijk

Publikováno v: Tim Oosterwijk
Oosterwijk, T 2018, ' Approximation Algorithms in Allocation, Scheduling and Pricing ', PhD, Maastricht University, Maastricht .

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 a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c7af3cc4cde50edbabd54f973834ed0
https://cris.maastrichtuniversity.nl/en/publications/9ebedbe9-ee84-42ff-be31-11414a5e11dd

Approximating vector scheduling: almost matching upper and lower bounds

Autor: Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan

Publikováno v: Algorithmica, 76(4), 1077-1096. Springer
Algorithmica
Algorithmica, 76(4), 1077-1096. Springer Verlag

We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs, represented as d-dimensional vectors in \documentclass[12pt]{minimal} \usepackage{ams

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee18c151d4c8c7be529b046a8f88a989
https://research.tue.nl/nl/publications/03d9bc9d-38e4-4761-8147-8a20d48a1d2c

High Multiplicity Scheduling with Switching Costs for few Products

Autor: Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk, Michaël Gabay

Publikováno v: Annual International Conference of the German Operations Research Society (GOR)
Annual International Conference of the German Operations Research Society (GOR), Sep 2014, RWTH Aachen University, Germany. pp.437-443, ⟨10.1007/978-3-319-28697-6_61⟩
Gabay, M, Grigoriev, A, Kreuzen, V J & Oosterwijk, T 2016, High Multiplicity Scheduling with Switching Costs for few Products . in Operations Research Proceedings . vol. 2014, Springer .
Operations Research Proceedings 2014: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), RWTH Aachen University, Germany, September 2–5, 2014, 437-443
STARTPAGE=437;ENDPAGE=443;TITLE=Operations Research Proceedings 2014
Operations Research Proceedings, 2014
Operations Research Proceedings ISBN: 9783319286952
OR

We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and a set of products associated with a constant demand rate, maximum loa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fac6590200d797d91ab8f15d2b4d97d
http://arxiv.org/abs/1504.00201v1