Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Malin Rau"'
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64f470f22b1521685b51b42231418a02
https://doi.org/10.1007/s00453-023-01130-2
https://doi.org/10.1007/s00453-023-01130-2
Publikováno v:
Mathematical Programming. 195:367-401
Integer linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd49ebcaa048879f3caaa1415c7c393f
https://doi.org/10.1007/s10107-021-01694-3
https://doi.org/10.1007/s10107-021-01694-3
Publikováno v:
ACM Transactions on Algorithms. 15:1-28
We consider two related scheduling problems: single resource-constrained scheduling on identical parallel machines and a generalization with resource-dependent processing times. In both problems, jobs require a certain amount of an additional resourc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::619416448a348e465d60685fff37feaf
https://doi.org/10.1145/3302250
https://doi.org/10.1145/3302250
Publikováno v:
Theory of Computing Systems. 64:120-140
We study the Parallel Task Scheduling problem $Pm|size_j|C_{\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \geq 5$, while it is solvable in pseudo-polynomial time for each $m \leq 3$. We give a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41e267c9de33f9157d3dcf0a5c6da347
https://doi.org/10.1007/s00224-019-09910-6
https://doi.org/10.1007/s00224-019-09910-6
Autor:
Malin Rau, Klaus Jansen
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030293994
Euro-Par
Euro-Par
We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing problem. For both problems, there is no algorithm with approximation ratio better than 2 unless \(\mathrm {P}= \mathrm {NP}\). In this paper, we present an algorithm with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3c95f9139871ac9893b401b1cc10185
https://doi.org/10.1007/978-3-030-29400-7_8
https://doi.org/10.1007/978-3-030-29400-7_8
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783319905297
CSR
CSR
We study Parallel Task Scheduling \(Pm|size_j|C_{\max }\) with a constant number of machines. This problem is known to be strongly NP-complete for each \(m \ge 5\), while it is solvable in pseudo-polynomial time for each \(m \le 3\). We give a positi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b26c35b3a497457ee53492d01e6d067
https://doi.org/10.1007/978-3-319-90530-3_15
https://doi.org/10.1007/978-3-319-90530-3_15
Autor:
Klaus Jansen, Malin Rau
We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which minimizes the pack
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbc8888d3266908d9d3bee485da6f1ba
http://arxiv.org/abs/1610.04430
http://arxiv.org/abs/1610.04430