Stanisław Gawiejnowicz, Ph.D., D.Sc.

Scientific Title: Professor
Position: Full Professor
Room: B4-06
Phone: +48 61 829 5334
E-mail: stgawiej at amu dot edu dot pl

Google Scholar Profile
Research Gate Profile
ORCID Profile

Office hours: Tuesday, 12:00-13:00; Thursday, 9:00-10:00 (MS Teams, after an appointment)

Scientific interests

  • Algorithmics, scheduling theory, complexity theory and their applications.
  • Complexity analysis of scheduling problems and algorithms, with focus on scheduling problems with variable job processing times.
  • Design and analysis of polynomial exact, approximation, heuristic and meta-heuristic algorithms for scheduling problems.

Selected publications

Research monographs

  • 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.
  • A. Agnetis, J-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, A. Soukhal, Multiagent Scheduling: Models and Algorithms, Springer, 2014, 271pp, ISBN 978-3-642-41879-2, doi: 10.1007/978-3-642-41880-8.
  • S. Gawiejnowicz, Time-Dependent Scheduling, Springer, 2008, 390pp, ISBN 978-3-540-69445-8, doi:10.1007/978-3-540-69446-5. 

Edited special issues 

Journal papers

  • S. Gawiejnowicz, B. M-T. Lin, G. Mosheiov, Dynamic scheduling problems in theory and practice, Journal of Scheduling, 27 (2024), 225-226, doi: 10.1007/s10951-023-00798-2 (impact factor 2.0).
  • 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).
  • 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.9).
  • 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).
  • A. Agnetis, S. Gawiejnowicz, B. M-T. Lin, G. Mosheiov, Editorial: Dynamic Scheduling Problems, Journal of Scheduling, 23 (2020), 629-630, doi: 10.1007/s10951-020-00673-4 (impact factor 1.765).
  • S. Gawiejnowicz, W. Kurc, New results for an open time-dependent scheduling problem, Journal of Scheduling, 23 (2020), 733-744, doi: 10.1007/s10951-020-00662-7 (impact factor 1.765).
  • S. Gawiejnowicz, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Journal of Scheduling, 23 (2020), 3-47, doi:10.1007/s10951-019-00630-w (impact factor 1.765).
  • M. Żurowski, S. Gawiejnowicz, Scheduling preemptable position-dependent jobs on two parallel identical machines, Computers and Industrial Engineering, 132 (2019), 373-384, doi:10.1016/j.cie.2019.03.043 (impact factor 3.195).
  • 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/ (impact factor 4.376).
  • S. Gawiejnowicz, C. Suwalski, Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria, Computers & Operations Research, 52 (2014), 135-146, doi:10.1016/j.cor.2014.06.020 (impact factor 1.861).
  • S. Gawiejnowicz, A. Kononov, Isomorphic scheduling problems, Annals of Operations Research, 213 (2014), 131-145, doi:10.1007/s10479-012-1222-2 (impact factor 1.029).
  • 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 (impact factor 1.516).
  • 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 (impact factor 1.491).
  • 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 (impact factor 1.124).
  • 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 (impact factor 2.093).
  • 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).
  • 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 (impact factor 2.093).
  • 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 (impact factor 1.093).

Conference papers

  • S. Gawiejnowicz, T. Onak, C. Suwalski, A new library for evolutionary algorithms, Lecture Notes in Computer Science, 3911 (2006), 414-421, doi:10.1007/11752578_50.
  • 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, doi:10.1007/11752578_15.
  • 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, doi:10.1007/978-3-540-24669-5_12 (impact factor 0.513).
  • 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, doi:10.1007/3-540-48086-2_9 (impact factor 0.515).
  • 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), Międzyzdroje, Poland, August 26-29, 2018, 926-931, doi:10.1109/MMAR.2018.8485820.

Selected conference presentations

  • The 37th European Chapter on Combinatorial Optimization (Ghent, Belgium, VI 2024)
  • The 4th International Workshop on Dynamic Scheduling Problems (Winterthur, Switzerland, VI 2023)
  • The Annual Conference of Operations Research Society of Israel (Tel Aviv – Yafo, Israel, V 2023)
  • The 3rd International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VII 2021)
  • The 14th Workshop “Models and Algorithms for Planning and Scheduling Problems” (Renesse, The Netherlands, VI 2019)
  • The 2nd International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VI 2018)
  • The 13th Workshop “New Challenges in Scheduling Theory” (Aussois, France, III-IV 2018)
  • The 13th Workshop “Models and Algorithms for Planning and Scheduling Problems” (Seeon-Seebruck, Germany, VI 2017)
  • The Annual Conference of Operations Research Society of Israel (Tel Aviv – Ramat Gan, Israel, V 2017)
  • The 28th European Conference on Operational Research (Poznań, Poland, VII 2016)
  • The 1st International Workshop on Dynamic Scheduling Problems (Poznań, Poland, VI-VII 2016)
  • The 13th Workshop “Advances in Continuous Optimization” (Edinburgh, United Kingdom, VII 2015)
  • The 27th International Conference “European Chapter on Combinatorial Optimization” (Monachium, Germany, IV 2014)
  • The 11th Workshop “New Challenges in Scheduling Theory” (Aussois, France, III-IV 2014)
  • The 26th European Conference on Operational Research (Rome, Italy, VII 2013)
  • The 11th Workshop “Advances in Continuous Optimization” (Florence, Italy, VII 2013)
  • International Symposium “Combinatorial Optimization” (Oxford, United Kingdom, IX 2012)
  • The 25th European Conference on Operational Research (Vilnius, Lithuanie, VII 2012)


  • Algorithmics of production systems
  • Algorithmics in system design
  • Algorithms and programming
  • Algorithms and data structures
  • Fundamentals of complexity theory
  • Industrial algorithmics
  • M. S. seminar
  • Scheduling algorithms

M.S. these supervision


  • Computational complexity of selected problems of scheduling unit-time jobs on parallel processors
  • Evolutionary algorithms and their selected applications
  • Project allocation problem and its variants
  • Methods of parallel search of go game tree
  • Scheduling with financial constraints
  • Selected agent scheduling problems
  • Selected applications of serial-parallel graphs in scheduling
  • Single machine scheduling problems with learning effect
  • Selected open shop scheduling problems
  • Selected topics in algorithmics of voting systems
  • Solution methods of selected timetabling problems
  • Stable marriage problem and its applications
  • Theoretical and practical aspects of computer programs for chess playing