prof. dr hab. inż. Małgorzata Sterna

MONOGRAFIE  I  ROZDZIAŁY W MONOGRAFIACH

J. Błażewicz, K. Ecker, E. Pesch, G. Schimidt,  M. Sterna, J. Węglarz, Handbook on Scheduling. From Theory to Practice, Springer, Heidelberg (2019).

M. Sterna, Late Work scheduling in shop systems, Rozprawy nr 405, Wydawnictwo Politechniki Poznańskiej, Poznań, 2006 (ISBN 978-83-7143-269-9).

M. Sterna, Problems and Algorithms in Non-Classical Shop Scheduling, Wydawnictwo Naukowe Polskiej Akademii Nauk, Poznań, 2000 (ISBN 83-87671-39-8).

J. Błażewicz, E. Pesch, M. Sterna, A branch and bound algorithm for the job shop scheduling problem, w: A. Drexl, A. Kimms (Eds.) Beyond Manufacturing Resource Planning (MRPII). Advanced Models and Methods for Production Planning. Chapter 4:  Sequencing and Scheduling, Springer, Heidelberg (1998) 219-254.

 

WYBRANE ARTYKUŁY W CZASOPISMACH

X. Chen, Q. Miao, B.M.T. Lin, M. Sterna, J. Błażewicz, Two-machine flow shop scheduling with a common due date to maximize total early work, European Journal of Operational Research  300/2 (2022), 504-511.

M. Sterna, Late and early work scheduling: a survey, Omega 104 (2021), 102453.

X. Chen, S. Kovalev, Y. Liu, M. Sterna, I. Chalamon, J. Błażewicz, Semi-online scheduling on two identical machines with a common due date to maximize total early work, Discrete Applied Mathematics 290 (2021), 71-78. 

X. Chen, S. Kovalev, M. Sterna, J. Błażewicz, Mirror scheduling problems with early and late work criteria, Journal of Scheduling 24/5 (2021), 483-487.

X. Chen, W. Wang, P. Xie, X. Zhang, M. Sterna, J. Błażewicz, Exact and approximation algorithms for scheduling on two identical machines with early work maximization, Computers & Industrial Engineering 144 (2020), 106449.

X. Chen, Y. Liang, M. Sterna, W. Wang, J. Błażewicz, Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date, European Journal of Operational Research 284 (2020), 67-74.

J. Błażewicz, X. Chen, R.C.T. Lee, B.M.T. Lin, F.-C. Lin, E. Pesch, M. Sterna, Z. Wang, Clarification of lower bounds of two-machine flowshop scheduling to minimize total late work, Engineering Optimization 51/7 (2019), 1279-1280.

X. Chen, Z. Wang, E. Pesch, M. Sterna, J. Błażewicz, Two-machine flow-shop scheduling to minimize total late work: revisited, Engineering Optimization 51/7 (2019), 1268-1278.

M. Sterna, K. Czerniachowska, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, Journal of Optimization Theory and Applications 174/3 (2017), 927-944.

X. Chen, V. Chau, P. Xie, M. Sterna, J. Błażewicz, Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect, Computers & Industrial Engineering 111 (2017), 176-182.

M.-L. Espinouse, G. Pawlak, M. Sterna, Complexity of scheduling problem in single machine flexible manufacturing system with cyclic transportation and unlimited buffers, Journal of Optimization Theory and Applications 173/3 (2017), 1042-1054.

X. Chen, M. Sterna, X. Han, J. Błażewicz, Scheduling on parallel identical machines with late work criterion: Offline and online cases, Journal of Scheduling 19/6 (2016), 729-736.

M. Cicheński, M. Miszkiewicz, M. Jarus, M. Sterna, J. Szymczak, Supporting supply process in charitable organizations by genetic algorithm, Computers & Industrial Engineering 88 (2015) 39-48.

M. Sterna, A survey of scheduling problems with late work criteria, Omega 39/2 (2011) 120-129.

M. Sterna, E. Pesch, Late work minimization in flow shop by a genetic algorithm, Computers & Industrial Engineering 57/4 (2009) 1202-1209.

J. Juraszek, E. Pesch, M. Sterna, Revenue maximization on parallel machines, Operations Research Proceedings 2008, Springer, Heidelberg (2009) 153-158.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Computers & Operations Research 35/2 (2008) 574-599.

M. Sterna, Late work minimization in a small flexible manufacturing system, Computers & Industrial Engineering 52/2 (2007) 210-228.

M. Sterna, Dominance relations for two-machine flow shop problem with late work criterion, Bulletin of the Polish Academy of Sciences. Technical Sciences 55/1 (2007) 59-69.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, A note on two-machine job shop with weighted late work criterion, Journal of Scheduling 10/2 (2007) 87-95.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, A comparison of solution procedures for the flow shop scheduling with late work criterion, Computers & Industrial Engineering 49/4 (2005) 611-624.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, Metaheuristic algorithms for late work minimization in two-machine flow shop with  common due date, Lecture Notes in Artificial Intelligence 3698 (2005) 222-234.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, The two-machine flow shop scheduling problem with weighted late work criterion and common due date, European Journal of Operational Research 165/2 (2005) 408-415.

J. Błażewicz, E. Pesch, M. Sterna, A novel representation of graph structures in web mining and data analysis, Omega 33/1 (2005) 65-71.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, Flow shop scheduling with late work criterion – choosing the best solution strategy, Lecture Notes in Computer Science 3285 (2004) 68-75.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, Open shop scheduling problems with late work criteria, Discrete Applied Mathematics  134 (2004) 1-24.

J. Błażewicz, E. Pesch, M. Sterna, Extension of disjunctive graph model for job shop scheduling problem, w: B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, U. Rieder (Eds.) Operations Research Proceedings 2000, Springer, Heidelberg (2001) 359-365.

J. Błażewicz, E. Pesch, M. Sterna, The disjunctive graph machine representation of the job shop scheduling problem, European Journal of Operational Research 127/2 (2000) 317-331.

J. Błażewicz, E. Pesch, M. Sterna, F. Werner, Total late work criteria for shop scheduling problems, w: K. Inderfurth, G. Schwödiauer, W. Domschke, F. Juhnke, P. Kleinschmidt, G. Wäscher (Eds.), Operations Research Proceedings 1999, Springer, Heidelberg (2000) 354-359.

J. Błażewicz, E. Pesch, M. Sterna, A note on disjunctive graph representation, Bulletin of the Polish Academy of Sciences. Technical Sciences 47/1 (1999) 103-114.

J. Błażewicz, G. Pawlak, M. Sterna, B. Walter, M. Zawirski, A heuristic algorithm for schedule optimization in FMS environment, Foundations of Computing and Decision Sciences  24/4 (1999) 189-207.

J. Błażewicz, M. Kasprzak, M. Sterna, J. Węglarz, Selected combinatorial optimization problems arising in molecular biology, Ricerca Operativa 26/80 (1996) 35-63.

 

 

 

malgorzata.sterna(at)cs.put.poznan.pl

Instytut Informatyki

Politechnika Poznańska

ul. Piotrowo 2

60-965 Poznań

 

pokój 9 - Centrum Wykładowe

+48 61 6652982

informacje dla studentów są dostępne na platformie uczelnianej eKursy

ORCID

Web of Science

Scopus

Google Scholar

Research Gate