Publications

2023

• S. Gawiejnowicz, W. Gajda, A note on exact and heuristic algorithms for generation of V- and Λ-shaped sequences, Computers and Industrial Engineering, 178 (2023), 109081, DOI:  10.1016/j.cie.2023.109081 (impact factor 7.18).
• S. Gawiejnowicz, N. Halman, H. Kellerer, Knapsack problems with position-dependent item weights or profits, Annals of Operations Research, 326 (2023), 137-156, DOI: 10.1007/s10479-023-05265-x (impact factor 4.135).
• J. Berlińska, M. Drozdowski, T. Robertazzi, Optimum Large Sensor Data Filtering, Networking and Computing, Proceedings of the 18th Conference on Computer Science and Intelligence Systems, Annals of Computer Science and Information Systems 35 (2023) 431-440, DOI: 10.15439/2023F5436
• J. Berlińska, Scheduling data gathering with variable communication speed and startup times, Proceedings of the Fourth International Workshop on Dynamic Scheduling Problems, Winterthur 2023, 25-30.

2022

• 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, Makespan minimization in tree data gathering networks with memory limits, Proceedings of the 15th Workshop on Models and Algorithms for Planning and Scheduling Problems, Oropa 2022, 218-221.

2021

• 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
• S. Gawiejnowicz, M. Kolińska, Two- and three-machine open shop scheduling using LAPT-like rules, Computers and Industrial Engineering, 157 (2021), 107261, DOI:  10.1016/j.cie.2021.107261 (impact factor 4.135).
• 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, 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, B. Mor, Scheduling in data gathering networks with variable communication speed and a processing stage, Proceedings of the Third International Workshop on Dynamic Scheduling Problems, Poznań 2021, 27-32.
• J. Berlińska, Scheduling to minimize maximum lateness in tree data gathering networks, Proceedings of the 17th International Workshop on Project Management and Scheduling, Toulouse 2021, 54-57.

2020

• A. Agnetis, S. Gawiejnowicz, B. M-T. Lin, G. Mosheiov, Editorial: Dynamic Scheduling Problems, Journal of Scheduling (2020), doi: 10.1007/s10951-020-00673-4 (impact factor 1.598).
• S. Gawiejnowicz, Models and Algorithms of Time-Dependent Scheduling, Springer, 2020, 550pp, ISBN 978-3-662-59361-5, doi:10.1007/978-3-662-59362-2.
• S. Gawiejnowicz, W. Kurc, New results for an open time-dependent scheduling problem, Journal of Scheduling (2020), doi:10.1007/s10951-020-00662-7 (impact factor 1.598).
• S. Gawiejnowicz, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Journal of Scheduling, 2020, DOI: 10.1007/s10951-019-00630-w
• 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, 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, Springer, Cham 2020, 1139-1148.
  DOI: 10.1007/978-3-030-21803-4_112
• 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, Springer, Cham 2020, 230-241.
  DOI: 10.1007/978-3-030-43222-5_20

2019

• 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, 453-458.
  DOI: 10.1007/978-3-030-18500-8_56
• J. Berlińska, B. Przybylski, Scheduling for gathering multitype data, Proceedings of the 14th Workshop on Models and Algorithms for Planning and Scheduling Problems, Renesse 2019, 170-172.
• M. Żurowski, S. Gawiejnowicz, Scheduling preemptable position-dependent jobs on two parallel identical machines, Computers & Industrial Engineering 132: 373-384 (2019).
  DOI: 10.1016/j.cie.2019.03.043

2018

• 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 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, Springer, Cham 2018, 135-144.
  DOI: 10.1007/978-3-319-78054-2_13
• J. Berlińska, Scheduling non-preemptive data gathering affected by background communications, Proceedings of the Second International Workshop on Dynamic Scheduling Problems, Poznań 2018, 41-44.
• J. Berlińska, Scheduling data gathering with limited base station memory, Proceedings of the 16th International Conference on Project Management and Scheduling, Rome 2018, 42-45.
• B. Przybylski, A new model of parallel-machine scheduling with integral-based learning effect, Computers & Industrial Engineering 121: 189-194 (2018).
  DOI: 10.1016/j.cie.2018.05.035
• M. Żurowski, Preemptive scheduling of jobs with a learning effect on two parallel machines, Operations Research Proceedings 2017. Springer, 587-592, 2018.
  DOI: 10.1007/978-3-319-89920-6_78
• M. Żurowski, S. Gawiejnowicz, An enumerative algorithm for a two-machine preemptive job scheduling with a learning effect, Proceedings of the 23rd International Conference on Methods and Models in Automation and Robotics (MMAR 2018), Poland 2018, 926-931.
  DOI: 10.1109/MMAR.2018.8485820

2017

• B. Przybylski, Precedence constrained parallel-machine scheduling of position-dependent jobs, Optimization Letters, 11 (2017) no. 7, 1273–1281.
  DOI: 10.1007/s11590-016-1075-8
• J. Berlińska, Scheduling Data Gathering in 2-Level Tree Networks, Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, Seeon Abbey 2017, 17-19.

2016

• J. Berlińska, Scheduling data gathering with variable communication speed, Proceedings of the First International Workshop on Dynamic Scheduling Problems, Poznań 2016, 29-32.

2015

• S. Gawiejnowicz, W. Kurc: Structural properties of time-dependent scheduling with the lp norm , Omega International Journal of Management Science, 57 (2015), 196-202.
  DOI: 10.1016/j.omega.2015.04.015
• J. Berlińska, M. Drozdowski, Algorithms to Mitigate Partition Skew in MapReduce Applications, Raport Techniczny RA-01/15, Instytut Informatyki Politechniki Poznańskiej, 2015.
• J. Berlińska, M. Drozdowski, Scheduling Multilayer Divisible Computations, RAIRO – Operations Research 49 (2015) 339-368.
  DOI: 10.1051/ro/2014050
• 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

2014

• S. Gawiejnowicz, A. Kononov: Isomorphic scheduling problems, Annals of Operations Research, 213 (2014), no. 1, 131-145.
  DOI: 10.1007/s10479-012-1222-2
• S. Gawiejnowicz, C. Suwalski: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria, Annals of Operations Research, 213 (2014), no. 1, 131-145.
  DOI: 10.1016/j.cor.2014.06.020
• 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

2013

• M. Dębczyński, S. Gawiejnowicz: Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion, Computers & Industrial Engineering, 64 (2013), 273-279.
  DOI: 10.1016/j.cie.2012.10.010
• J. Berlińska, M. Drozdowski, Mitigating Partitioning Skew in MapReduce Computations, Proceedings of the 6th Multidisciplinary International Scheduling Conference: Theory & Applications, Ghent 2013, 80-90.

2011

• S. Gawiejnowicz, T-C. Lai, M-H. Chiang: Scheduling linearly shortening jobs under precedence constraints, Applied Mathematical Modelling, 35 (2011), no. 4, 2005-015.
  DOI: 10.1016/j.apm.2010.11.012
• S. Gawiejnowicz, W-C. Lee, C-L. Lin, C-C. Wu: Single-machine scheduling of proportionally deteriorating jobs by two agents, Journal of the Operational Research Society, 62 (2011), 1983-1991.
  DOI: 10.1057/jors.2010.171
• J. Berlińska, M. Drozdowski, Scheduling and Performance of divisible MapReduce applications, 10th Workshop on Models and Algorithms for Planning and Scheduling Problems, Nymburk 2011, 162-164.
• 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

2010

• S. Gawiejnowicz, A. Kononov, Complexity and approximability of scheduling resumable proportionally deteriorating jobs, European Journal of Operational Research, 200 (2010), no. 1, 305-308.
  DOI: 10.1016/j.ejor.2008.12.014
• S. Gawiejnowicz, B.M-T. Lin, Scheduling deteriorating jobs under mixed deterioration, Applied Mathematics and Computation, 216 (2010), no. 2, 438-447.
  DOI: 10.1016/j.amc.2010.01.037
• D. Okołowski, S. Gawiejnowicz, Exact and heuristic algorithms for parallel-machine scheduling problems with DeJong’s learning effect, Computers and Industrial Engineering, 59 (2010), no. 2, 272-279.
  DOI: 10.1016/j.cie.2010.04.008
• S. Gawiejnowicz, W. Kurc, L. Pankowska, Solving a permutation problem by a fully polynomial-time approximation scheme, Discussiones Mathematicae: Differential Inclusions, Control & Optimization, 30 (2010), no. 2, 191-203.
• 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, Springer, Berlin 2010, 1-10.
  DOI: 10.1007/978-3-642-14403-5_1
• 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

2009

• S. Gawiejnowicz, W. Kurc, L. Pankowska, Equivalent time-dependent scheduling problems, European Journal of Operational Research, 196 (2009), no. 3, 919-929.
  DOI: 10.1016/j.ejor.2008.04.040
• S. Gawiejnowicz, W. Kurc, L. Pankowska, Conjugate time-dependent scheduling problems, Journal of Scheduling, 12 (2009), no. 5, 543-553, doi:  10.1007/s10951-009-0121-0 (impact factor 1.265).
• J. Berlińska, M. Drozdowski, Dominance Properties for Divisible MapReduce Computations, Raport Techniczny RA-09/09, Instytut Informatyki Politechniki Poznańskiej, 2009.
• 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, 321-329.
• 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

2008

• J. Berlińska, M. Drozdowski, M. Lawenda, Multi-Installment Divisible Loads Scheduling in Systems with Limited Memory, Raport Techniczny RA-07/08, Instytut Informatyki Politechniki Poznańskiej, 2008.

2007

• S. Gawiejnowicz, B.M-T. Lin, Scheduling deteriorating jobs under mixed deterioration, paper no. 782, Proceedings of the 8th Asia-Pacific Industrial Engineering and Management Systems, Yunlin Institute of Technology, Kaohsiung, 2007, 10pp.
• S. Gawiejnowicz, A. Kononov, Scheduling resumable deteriorating jobs, Proceedings of the Third Multidisciplinary International Conference on Scheduling: Theory and Applications (August 28-31, 2007, Paris, France), 567-569.
• S. Gawiejnowicz: Scheduling deteriorating jobs subject to job or machine availability constraints, European Journal of Operational Research, 180 (2007), no. 1, 472-478.
  DOI: 10.1016/j.ejor.2006.04.021

2006

• S. Gawiejnowicz, W. Kurc, L. Pankowska, Pareto and scalar bicriterion scheduling of deteriorating jobs, Computers and Operations Research, 33 (2006), no. 3, 746-767.
  DOI: 10.1016/j.cor.2004.07.016
• S. Gawiejnowicz, W. Kurc, L. Pankowska, Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences, Discrete Applied Mathematics, 154 (2006), no. 15, 2150-2166.
  DOI: 10.1016/j.dam.2005.04.016
• S. Gawiejnowicz, W. Kurc, L. Pankowska, Parallel machine scheduling of deteriorating jobs by modified steepest descent search, Lecture Notes in Computer Science, 3911 (2006), 116‑123.
• S. Gawiejnowicz, T. Onak, C. Suwalski, A new library for evolutionary algorithms, Lecture Notes in Computer Science, 3911 (2006), 414-421.

2004

• S. Gawiejnowicz, Book Review: Peter Brucker (2004) Scheduling Algorithms, 4th ed., Mathematical Methods of OR, 60 (2004), 523-524.
• S. Gawiejnowicz, W. Kurc, L. Pankowska, Minimizing time-dependent total completion time on parallel identical machines, Lecture Notes in Computer Science, 3019, Springer 2004, 89-96.

2002

• S. Gawiejnowicz, W. Kurc, L. Pankowska, A greedy approach for a time-dependent scheduling problem, Lecture Notes in Computer Science, 2328, Springer 2002, 79-86.

2001

• A. Kononov, S. Gawiejnowicz, NP-hard cases in scheduling deteriorating jobs on dedicated machines, Journal of the Operational Research Society, 52 (2001), 708-717.

1999

• J. Błażewicz, S. Gawiejnowicz, Scheduling tasks and vehicles in a flexible manufacturing system subject to mean flow time minimization, Foundations of Computing and Decision Sciences, 24 (1999), no. 1, 1-12.

1997

• S. Gawiejnowicz, Minimizing the flow time and the lateness on a processor with a varying speed, Ricerca Operativa, 27 (1997), no. 53, 51-58.

1996

• S. Gawiejnowicz, A note on scheduling on a single processor with speed dependent on a number of executed jobs, Information Processing Letters, 57 (1996), no. 1, 297-300.
  DOI: 10.1016/0020-0190(96)00021-X
• S. Gawiejnowicz, Brief survey of continuous models of scheduling, Foundations of Computing and Decision Sciences, 21 (1996), no. 2, 81-100.

1995

• S. Gawiejnowicz, L. Pankowska, Scheduling jobs with varying processing times, Information Processing Letters, 54 (1995), no. 3, 175-178.
  DOI: 10.1016/0020-0190(95)00009-2