Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Deppert, Max A."'
One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is the {\sc Multiple TSP}: a set of $m\geq 1$ salespersons collectively traverses a set of $n$ cities by $m$ non-trivial tours, to minimize the total length of their
Externí odkaz:
http://arxiv.org/abs/2307.07180
Autor:
Deppert, Max A., Jansen, Klaus
We study a mutually enriching connection between response time analysis in real-time systems and the mixing set problem. Thereby generalizing over known results we present a new approach to the computation of response times in fixed-priority uniproce
Externí odkaz:
http://arxiv.org/abs/2210.02361
Consider the many shared resource scheduling problem where jobs have to be scheduled on identical parallel machines with the goal of minimizing the makespan. However, each job needs exactly one additional shared resource in order to be executed and h
Externí odkaz:
http://arxiv.org/abs/2210.01523
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a $(1+\epsilon)$-approximation solution for every $\epsilon > 0$, but the running time grows expo
Externí odkaz:
http://arxiv.org/abs/2107.13638
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedule all jobs within a fixed time period such that the peak load (the ma
Externí odkaz:
http://arxiv.org/abs/2105.07219
We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer $s$ that is specified by $n$ fixed remainders modulo integer divisors $a_1,\dots,a_n$ we consider remainder
Externí odkaz:
http://arxiv.org/abs/2002.07746
Autor:
Deppert, Max A., Jansen, Klaus
We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$ identical parallel machines. For every class there is a setup time which is required whenever a machine switches from the processing of one class to another class. The objectiv
Externí odkaz:
http://arxiv.org/abs/1810.01223
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Berndt, Sebastian, Deppert, Max A., Jansen, Klaus, Rohwedder, Lars, Phillips, Cynthia A., Speckmann, Bettina
Publikováno v:
Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX '22), 104-116
STARTPAGE=104;ENDPAGE=116;TITLE=Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX '22)
STARTPAGE=104;ENDPAGE=116;TITLE=Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX '22)
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a (1 + ε)-approximation solution for every ε > 0, but the running time grows exponentially in 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6686cd62add811df0a4cf9d5e9f424b
https://doi.org/10.1137/1.9781611977042.9
https://doi.org/10.1137/1.9781611977042.9