Výsledky vyhledávání - "Arjen P. A. Vestjens"

Complexity of the job insertion problem in multi-stage scheduling

Autor: Gerhard J. Woeginger, Arjen P. A. Vestjens, Marc Wennink

Publikováno v: Operations Research Letters, 35(6), 754-758. Elsevier

The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additional job, find a feasible insertion of the additional job into the schedule that minimizes the resulting makespan. We prove that finding the optimal job

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b356902971d1dab6707fd8cdbb31965b
https://doi.org/10.1016/j.orl.2007.02.004

Zobrazit plný text záznamu

Constrained Maximin Designs for Computer Experiments

Autor: Peter Stehouwer, Dick den Hertog, Erwin Stinstra, Arjen P. A. Vestjens

Publikováno v: Technometrics. 45:340-346

Finding a design scheme for expensive computer experiments in arbitrary design regions is often a difficult task. A well-known criterion that is often used for computer experiments is the minimal (Euclidean) distance between any pair of design sites,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::eb662b8b91386db2f96131d9101880d7
https://doi.org/10.1198/004017003000000168

Zobrazit plný text záznamu

Scheduling uniform machines on-line requires nondecreasing speed ratios

Autor: Arjen P. A. Vestjens

Publikováno v: Mathematical Programming, 82(1-2), 225-234. Springer

We consider the following on-line scheduling problem. We have to schedulen independent jobs, wheren is unknown, onm uniform parallel machines so as to minimize the makespan; preemption is allowed. Each job becomes available at its release date, and t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d3bef2644f12efef4874dbb2aa5f11f
https://doi.org/10.1007/bf01585873

Zobrazit plný text záznamu

On-line and off-line approximation algorithms for vector covering problems

Autor: Noga Alon, Arjen P. A. Vestjens, Leah Epstein, Yossi Azar, Gerhard J. Woeginger, Sergey V. Sevastianov, János Csirik

Publikováno v: Scopus-Elsevier
Algorithmica, 21(1), 104-118. Springer
Algorithms — ESA '96 ISBN: 9783540616801
ESA
Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996), 406-418
STARTPAGE=406;ENDPAGE=418;TITLE=Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996)

This paper deals with vector covering problems in d -dimensional space. The input to a vector covering problem consists of a set X of d -dimensional vectors in [0,1] d . The goal is to partition X into a maximum number of parts, subject to the constr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::325328b60c61fd239fc17ce3758e3c1f
https://doi.org/10.1007/3-540-61680-2_71

Zobrazit plný text záznamu

Randomized algorithms for on-line scheduling problems : how low can't you go?

Autor: Leen Stougie, Arjen P. A. Vestjens

Publikováno v: Stougie, L & Vestjens, A P A 2002, ' Randomized algorithms for
scheduling problems : how low can't you go? ', Operations Research Letters, vol. 30, no. 2, pp. 89-96 . https://doi.org/10.1016/S0167-6377(01)00115-8
Operations Research Letters, 30(2), 89-96. Elsevier

We prove lower bounds on the competitive ratio of randomized algorithms for several on-line scheduling problems. The main result is a bound of e/(e-1) for the on-line problem with objective minimizing the sum of completion times of jobs that arrive o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adacfa3bd699f2ec66b0001e615d1b9b
https://research.vu.nl/en/publications/15b283ec-484d-4761-b943-76571e979fa0

Zobrazit plný text záznamu

Scheduling on identical machines : how good is LPT in an on-line setting?

Autor: Arjen P. A. Vestjens, Bo Chen

Publikováno v: Operations Research Letters, 21(4), 165-169. Elsevier
Scopus-Elsevier

We consider a parallel machine scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on m identical machines, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes avail

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa16316d134befff3dc1c95770618bad
https://research.tue.nl/nl/publications/de904892-af61-4f08-9796-78f4329aac18

Zobrazit plný text záznamu

Optimal on-line algorithms for single-machine scheduling

Autor: Han Hoogeveen, Arjen P. A. Vestjens

Publikováno v: Integer Programming and Combinatorial Optimization ISBN: 9783540613107
IPCO

We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::71ceea9543feb2b2a85ae98580fdc640
https://doi.org/10.1007/3-540-61310-2_30

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání