Joanna Berlińska

Joanna Berlińska

Auto-generated profile, based on publicly available information

Joanna Berlińska

Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2011 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
JBJ. Berlińska
J. Berlińska
MDMaciej Drozdowski
Maciej Drozdowski

1 November 2015 in European Journal of Operational Research
Verified
Journal Article
Closed access
JBJoanna Berlińska
Joanna Berlińska

1 April 2010 in Parallel Computing
Verified
Journal Article
Closed access
JBJ. Berlińska
J. Berlińska
MDMaciej Drozdowski
Maciej Drozdowski

1 February 2018 in Parallel Computing
Verified
Journal Article
Closed access
JBJoanna Berlińska
Joanna Berlińska
MDMaciej Drozdowski
Maciej Drozdowski

27 February 2019 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
JBJoanna Berlińska
Joanna Berlińska
In this paper, we analyze scheduling in data gathering networks with limited base station memory. The network nodes hold datasets that have to be gathered and processed by a single base station. A dataset transfer can only start if sufficient amount of memory is available at the base station. As soon as a node starts sending a dataset, the base station allocates a block of memory of corresponding size. The memory is released when computations on the dataset finish. We prove that minimizing the total data gathering and processing time is strongly NP-hard. As this problem is a special case of a specific resource constrained flow shop scheduling problem, for which an exact exponential algorithm is known, we propose several simple polynomial-time heuristics and two groups of local search algorithms, and test their performance in computational experiments. We show that the local search algorithms produce very good schedules, and one of the simple heuristics delivers solutions of comparable quality in a very short time.

1 May 2014 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
JBJoanna Berlińska
Joanna Berlińska