Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Mäcker, Alexander"'
Consider a scheduling problem in which jobs need to be processed on a single machine. Each job has a weight and is composed of several operations belonging to different families. The machine needs to perform a setup between the processing of operatio
Externí odkaz:
http://arxiv.org/abs/1910.08360
We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from process
Externí odkaz:
http://arxiv.org/abs/1809.10428
Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking $s$ time units wh
Externí odkaz:
http://arxiv.org/abs/1709.05896
Autor:
Bemmann, Pascal, Biermeier, Felix, Bürmann, Jan, Kemper, Arne, Knollmann, Till, Knorr, Steffen, Kothe, Nils, Mäcker, Alexander, Malatyali, Manuel, der Heide, Friedhelm Meyer auf, Riechers, Sören, Schaefer, Johannes, Sundermeier, Jannik
Consider a network in which $n$ distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. The server has to continuously monitor a given parameter defined over al
Externí odkaz:
http://arxiv.org/abs/1706.03568
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine
Externí odkaz:
http://arxiv.org/abs/1609.01184
Consider the continuous distributed monitoring model in which $n$ distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to continuously monitor a function defined over the values observed acro
Externí odkaz:
http://arxiv.org/abs/1601.04448
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to mi
Externí odkaz:
http://arxiv.org/abs/1504.07066
Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k nodes currently observing the largest values, for a given k between 1 and
Externí odkaz:
http://arxiv.org/abs/1410.7912
Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price \alpha > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et a
Externí odkaz:
http://arxiv.org/abs/1409.5366
Autor:
Mäcker, Alexander
Das Auftreten von Setupzeiten für die Bereitstellung von Maschinen ist eine natürliche Annahme bei der Betrachtung von Schedulingproblemen. Derartige Setups tauchen z.B. als Startzeiten von Maschinen oder für die Rekonfiguration zwischen der Ausf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fed04687ef487053bd3a119290b2b3a
https://digital.ub.uni-paderborn.de/hs/doi/10.17619/UNIPB/1-828
https://digital.ub.uni-paderborn.de/hs/doi/10.17619/UNIPB/1-828