Joanna Berlińska, Ph.D., D.Sc.

Scientific degree: doctor habilitated
Position: associate professor
Room: B4-5
Phone: 61 829 5333
E-mail: joanna.berlinska@amu.edu.pl
Web page: http://berlinska.home.amu.edu.pl

Office hours: Tuesday, 12:00-13:00 (B4-5)   Wednesday, 10:00-11:00 (MS Teams)

Research interests

  • Scheduling in parallel and distributed systems, especially in data gathering networks.
  • Complexity analysis of scheduling problems.
  • Design of heuristic algorithms for computationally hard problems.

Selected publications

Journal papers

  • J. Berlińska, B. Mor, Scheduling data gathering with background communications and a processing stage, Computers & Industrial Engineering 171 (2022) 108467, doi: 10.1016/j.cie.2022.108467.
  • J. Berlińska, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, Engineering Optimization 54 (2022) 218-231, doi: 10.1080/0305215X.2020.1861263.
  • J. Berlińska, B. Przybylski, Scheduling for gathering multitype data with local computations, European Journal of Operational Research 294 (2021) 453-459, doi: 10.1016/j.ejor.2021.01.043
  • J. Berlińska, A. Kononov, Y. Zinder, Two-machine flow shop with dynamic storage space, Optimization Letters 15 (2021) 2433–2454, doi: 10.1007/s11590-020-01645-5.
  • J. Berlińska, Scheduling in data gathering networks with background communications, Journal of Scheduling 23 (2020) 681-691, doi: 10.1007/s10951-020-00648-5.
  • J. Berlińska, Heuristics for scheduling data gathering with limited base station memory, Annals of Operations Research 285 (2020) 149-159, doi: 10.1007/s10479-019-03185-3.
  • J. Berlińska, M. Drozdowski, Comparing Load-Balancing Algorithms for MapReduce under Zipfian Data Skews, Parallel Computing 72 (2018) 14-28, doi: 10.1016/j.parco.2017.12.003.
  • J. Berlińska, Scheduling for data gathering networks with data compression, European Journal of Operational Research 246 (2015) 744-749, doi: 10.1016/j.ejor.2015.05.026.
  • J. Berlińska, M. Drozdowski, Scheduling Multilayer Divisible Computations, RAIRO – Operations Research 49 (2015) 339-368, doi: 10.1051/ro/2014050.
  • J. Berlińska, Communication scheduling in data gathering networks with limited memory, Applied Mathematics and Computation 235 (2014) 530-537, doi: 10.1016/j.amc.2014.03.024.
  • J. Berlińska, M. Drozdowski, Scheduling Divisible MapReduce Computations, Journal of Parallel and Distributed Computing 71 (2011) 450-459, doi: 10.1016/j.jpdc.2010.12.004.
  • J. Berlińska, M. Drozdowski, Heuristics for multi-round divisible loads scheduling with limited memory, Parallel Computing 36 (2010) 199-211, doi: 10.1016/j.parco.2010.02.004.
  • J. Berlińska, M. Drozdowski, M. Lawenda, Experimental study of scheduling with memory constraints using hybrid methods, Journal of Computational and Applied Mathematics 232 (2009) 638-654, doi: 10.1016/j.cam.2009.07.004.

Conference papers

  • Y. Zinder, J. Berlińska, C. Peter, Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph, w: P. Pardalos, M. Khachay, A. Kazakov (eds), Mathematical Optimization Theory and Operations Research: 20th International Conference MOTOR 2021, Lecture Notes in Computer Science 12755, Springer, Cham 2021, 280-295, doi: 10.1007/978-3-030-77876-7_19.
  • J. Berlińska, Makespan Minimization in Data Gathering Networks with Dataset Release Times, w: R. Wyrzykowski et al. (eds.), Parallel Processing and Applied Mathematics: 13th International Conference PPAM 2019, Part II, Lecture Notes in Computer Science 12044 (2020) 230-241, doi: 10.1007/978-3-030-43222-5_20.
  • J. Berlińska, A. Kononov, Y. Zinder, Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations, w: H. Le Thi, H. Le, T. Pham Dinh (eds.), Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing 991 (2020) 1139-1148, doi: 10.1007/978-3-030-21803-4_112.
  • J. Berlińska, Scheduling in a data gathering network to minimize maximum lateness, w: B. Fortz, M. Labbé (eds.), Operations Research Proceedings 2018, Springer, Cham 2019, pp. 453-458, doi: 10.1007/978-3-030-18500-8_56.
  • J. Berlińska, Scheduling data gathering with maximum lateness objective, w: R. Wyrzykowski et al. (eds.), Parallel Processing and Applied Mathematics: 12th International Conference PPAM 2017, Part II, Lecture Notes in Computer Science 10778 (2018) 135-144, doi: 10.1007/978-3-319-78054-2_13.
  • J. Berlińska, M. Drozdowski, Mitigating partitioning skew in MapReduce Computations, Proceedings of the 6th Multidisciplinary International Scheduling Conference: Theory & Applications, Ghent 2013, pp. 80-90.
  • J. Berlińska, Fully-polynomial time approximation schemes for scheduling divisible loads, w: R. Wyrzykowski et al. (eds.), Parallel Processing and Applied Mathematics: 8th International Conference PPAM 2009, Part II, Lecture Notes in Computer Science 6068 (2010) 1-10, doi: 10.1007/978-3-642-14403-5_1.
  • J. Berlińska, M. Drozdowski, Heuristics for Divisible Loads Scheduling in Systems with Limited Memory, Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory & Applications, Dublin 2009, pp. 321-329.

Selected conference talks

  • The 15th Workshop on Models and Algorithms for Planning and Scheduling Problems (Oropa, Italy, VI 2022)
  • The 35th Conference of the European Chapter on Combinatorial Optimization (online, VI 2022)
  • International Conference Mathematical Optimization Theory and Operations Research (Irkutsk, Russia, VII 2021)
  • The Third International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VII 2021)
  • The 34th Conference of the European Chapter on Combinatorial Optimization (Madrid, Spain, VI 2021)
  • The 17th International Workshop on Project Management and Scheduling (Toulouse, France, IV 2021)
  • The 13th International Conference on Parallel Processing and Applied Mathematics (Białystok, Poland, IX 2019)
  • The 6th World Congress on Global Optimization (Metz, France, VII 2019)
  • The 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (Renesse, the Netherlands, VI 2019)
  • International Conference on Operations Research (Brussels, Belgium, IX 2018)
  • The Second International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VI 2018)
  • The 31st Conference of the European Chapter on Combinatorial Optimization (Fribourg, Switzerland, VI 2018)
  • The 16th International Conference on Project Management and Scheduling (Rome, Italy, IV 2018)
  • The 12th International Conference on Parallel Processing and Applied Mathematics (Lublin, Poland, IX 2017)
  • The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (Seeon Abbey, Germany, VI 2017)
  • The 28th European Conference on Operational Research (Poznań, Poland, VII 2016)
  • The First International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VI-VII 2016)
  • The 6th Multidisciplinary International Scheduling Conference: Theory & Applications (Ghent, Belgium, VIII 2013)

Teaching

  • Algorithms and data structures
  • Combinatorial algorithms
  • Algorithms and Programming
  • Algorithmics in System Design
  • Scheduling
  • Advanced combinatorial algorithms