Zobrazeno 1 - 10
of 18
pro vyhledávání: '"André van Vliet"'
Autor:
Lianne Suurland, André van Vliet
Publikováno v:
MAB, Vol 88, Iss 12, Pp 556-573 (2014)
In dit artikel worden de resultaten van een empirisch onderzoek gepresenteerd naar de naleving van de voorschriften omtrent de toelichting in de jaarrekening op grond van de Wet normering bezoldiging topfunctionarissen publieke en semipublieke sector
Externí odkaz:
https://doaj.org/article/6f538e9029f64985b4ee517b18655d51
Autor:
André van Vliet, Lianne Suurland
Publikováno v:
MAB, Vol 88, Iss 12, Pp 556-573 (2014)
Maandblad voor Accountancy en Bedrijfseconomie 88(12): 556-573
Maandblad voor Accountancy en Bedrijfseconomie 88(12): 556-573
In dit artikel worden de resultaten van een empirisch onderzoek gepresenteerd naar de naleving van de voorschriften omtrent de toelichting in de jaarrekening op grond van de Wet normering bezoldiging topfunctionarissen publieke en semipublieke sector
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3db288358ccb8af670bacd0f0d8d78f0
https://mab-online.nl/article/31214/download/xml/
https://mab-online.nl/article/31214/download/xml/
Publikováno v:
Operations Research Letters. 18:223-232
The minimization of maximum completion time for scheduling n jobs on m identical parallel machines is an NP-hard problem for which many excellent heuristic algorithms have been developed. In this paper, the problem is investigated under the assumptio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3993cc1bcc0880013fecb5d5e9b1d75
https://doi.org/10.1016/0167-6377(95)00058-5
https://doi.org/10.1016/0167-6377(95)00058-5
Autor:
André van Vliet, Gábor Galambos
Publikováno v:
Computing. 52:281-297
In this paper we discuss lower bounds for the asymptotic worst case ratio of on-line algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1-dimensional bin packin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdd01c635b171883d917d7e0cbbf21f0
https://doi.org/10.1007/bf02246509
https://doi.org/10.1007/bf02246509
Publikováno v:
Scopus-Elsevier
Information Processing Letters, 51(5), 219-222. Elsevier
Information Processing Letters, 51(5), 219-222. Elsevier
We prove that any randomized algorithm for on-line scheduling jobs on m identical parallel machines must have a worst case ratio at least mm/(mm−(m−1)m) for every m, which tends to e/(e−1) ≈ 1.58 as m→∞. This ans wers a question posed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d9df4da8bf5016b75d385cf12e21572
https://doi.org/10.1016/0020-0190(94)00110-3
https://doi.org/10.1016/0020-0190(94)00110-3
Publikováno v:
Operations Research Letters, 16(4), 221-230. Elsevier
We investigate the problem of on-line scheduling a set of independent jobs on m parallel and identical machines with the objective of minimizing the overall finishing time. In this note, we are mainly interested in the cases where m is small. We deri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::719f8fd84fbfe028ff15b755062c92cf
https://doi.org/10.1016/0167-6377(94)90071-x
https://doi.org/10.1016/0167-6377(94)90071-x
Autor:
André van Vliet, János Csirik
Publikováno v:
Operations Research Letters. 13:149-158
In this paper we present an on-line algorithm for the d-dimensional bin packing problem. We use the idea of rounding up the size of an item to a size that can be packed efficiently. Although our algorithm is not a generalization of the 1-dimensional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83f024f651e5bbcb6da9efe7f41d9526
https://doi.org/10.1016/0167-6377(93)90004-z
https://doi.org/10.1016/0167-6377(93)90004-z
Autor:
André van Vliet
Publikováno v:
Information Processing Letters. 43:277-284
In 1980 Liang proved that every on-line algorithm for the bin packing problem has an asymptotic worst case ratio of at least 1.536…. In this paper we give an improved lower bound of 1.540….For the parametric case where all items are smaller than
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::681cf57fecaf11ce57dd05f32936a5ec
https://doi.org/10.1016/0020-0190(92)90223-i
https://doi.org/10.1016/0020-0190(92)90223-i
Publikováno v:
Interfaces. 22:4-14
An interactive optimization system for planning bulk deliveries was implemented by Suiker Unie, a farming cooperative that processes about 60 percent of the Dutch sugar beet crop. The bulk delivery problem differs in several aspects from the standard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::018e7ba6c1aab79bedd3ae2338ab46f1
https://doi.org/10.1287/inte.22.3.4
https://doi.org/10.1287/inte.22.3.4
Publikováno v:
European Journal of Operational Research, 115(2), 380-391. Elsevier
European Journal of Operational Research, 115, 380-391. Elsevier
European Journal of Operational Research, 115, 380-391. Elsevier
This paper deals with the problem of minimizing the transmission cost in an EDI system and proves the optimality of a policy which minimizes the slack of partial sums under conditions with practical interpretations. This policy is shown to be useful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ede2161d7c474e765e0c0a63de0247c6
https://pure.eur.nl/en/publications/b536b127-4cd2-4fd8-85e6-d064cca0cdea
https://pure.eur.nl/en/publications/b536b127-4cd2-4fd8-85e6-d064cca0cdea
