Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Hans Kellerer"'
Autor:
Hans Kellerer, Vitaly A. Strusevich
Publikováno v:
EURO Journal on Transportation and Logistics, Vol 12, Iss , Pp 100115- (2023)
The paper considers a special class of routing problems with the objective of minimizing the passengers risk. A major area of application of the low risk models is helicopter transportation widely used in the petroleum industry. In general, the total
Externí odkaz:
https://doaj.org/article/03944dbf0a314b4bbd3000c307c5eb4c
Autor:
Klaus Pötzelberger, Werner G. Müller, Hans Kellerer, Mushtaq Hussain, Michael Schimek, Reinhold Hatzinger, Walter Katzenbeisser, Friedrich Leisch, Herwig Friedl, Franz Konecny, Klemens Fuchs, Alfred Franz, Wolfgang Wertz, Jürgen Pilz
Publikováno v:
Austrian Journal of Statistics, Vol 27, Iss 3 (2016)
Weak Convergence and Empirical Processes (A.W. van der Vaart, J.A. Wellner) Quasi-Likelihood and its Application. A General Approach to Parameter Estimation (C.C. Heyde) Wahrscheinlichkeitsrechnung und Statistik in Beispielen und Aufgaben (V. Nolla
Externí odkaz:
https://doaj.org/article/c4f64fe71efc42da80d3cbe69ad3b6bd
Publikováno v:
Computer Science Journal of Moldova, Vol 11, Iss 2(32), Pp 209-228 (2003)
We are given a set of identical machines and a sequence of jobs from which we know the sum of the job weights in advance. The jobs have to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with per
Externí odkaz:
https://doaj.org/article/069395c3b4344540a70a2381fbce2ffc
Publikováno v:
Annals of Operations Research.
We consider three new knapsack problems with variable weights or profits of items, where the weight or profit of an item depends on the position of the item in the sequence of items packed in the knapsack. We show how to solve the problems exactly us
Publikováno v:
Annals of Operations Research. 298:1-5
Publikováno v:
Procedia Computer Science. 180:825-832
This paper addresses the scheduling of automated guided vehicles (AGVs) in a cyclic flexible flow shop environment. The vehicles travel along a single loop. All production machines are located alongside the track in the required order, with a possibi
Publikováno v:
Theoretical Computer Science.
We consider the scheduling model with two identical machines and jobs which arrive online in a list and are assigned to the machines with the objective of minimizing the makespan. Differently from the pure online version, we know in advance a lower b
Publikováno v:
European Journal of Operational Research. 278:160-169
A selfish bin packing game is a variant of the classical bin packing problem in a game theoretic setting. In our model the items have not only a size but also a nonnegative weight. Each item plays the role of a selfish agent, and any agent/item pays
Autor:
Imed Kacem, Hans Kellerer
Publikováno v:
Discrete Applied Mathematics. 264:76-89
We consider the problem of scheduling independent jobs with a common due date on a single machine with the objective of maximizing the number of early jobs. The processing times are uncertain and take any value from a certain job dependent interval.
We address the single machine scheduling problem to minimize the total weighted earliness and tardiness about a nonrestrictive common due date. This is a basic problem with applications to the just-in-time manufacturing. The problem is linked to a Bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4e69cd16d9f7805791bfa4c90f669a9