| The disjunctive graph machine representation of the job shop scheduling problem J Błażewicz, E Pesch, M Sterna European Journal of Operational Research 127 (2), 317-331, 2000 | 129 | 2000 |
| A survey of scheduling problems with late work criteria M Sterna Omega 39 (2), 120-129, 2011 | 119 | 2011 |
| Open shop scheduling problems with late work criteria J Błażewicz, E Pesch, M Sterna, F Werner Discrete Applied Mathematics 134 (1-3), 1-24, 2004 | 78 | 2004 |
| The two-machine flow-shop problem with weighted late work criterion and common due date J Błażewicz, E Pesch, M Sterna, F Werner European Journal of Operational Research 165 (2), 408-415, 2005 | 70 | 2005 |
| Scheduling on parallel identical machines with late work criterion: Offline and online cases X Chen, M Sterna, X Han, J Blazewicz Journal of Scheduling 19, 729-736, 2016 | 64 | 2016 |
| Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date J Blazewicz, E Pesch, M Sterna, F Werner Computers & Operations Research 35 (2), 574-599, 2008 | 64 | 2008 |
| Late and early work scheduling: A survey M Sterna Omega 104, 102453, 2021 | 50 | 2021 |
| A comparison of solution procedures for two-machine flow shop scheduling with late work criterion J Blazewicz, E Pesch, M Sterna, F Werner Computers & Industrial Engineering 49 (4), 611-624, 2005 | 49 | 2005 |
| Late work minimization in flow shops by a genetic algorithm E Pesch, M Sterna Computers & Industrial Engineering 57 (4), 1202-1209, 2009 | 38 | 2009 |
| Late work minimization in a small flexible manufacturing system M Sterna Computers & Industrial Engineering 52 (2), 210-228, 2007 | 37 | 2007 |
| Problems and algorithms in non-classical shop scheduling M Sterna Scientific Publishers OWN [Ośrodek Wydawnictw Naukowych], 2000 | 36 | 2000 |
| A note on the two machine job shop with the weighted late work criterion J Blazewicz, E Pesch, M Sterna, F Werner Journal of Scheduling 10 (2), 87-95, 2007 | 34 | 2007 |
| Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work M Sterna, K Czerniachowska Journal of Optimization Theory and Applications 174, 927-944, 2017 | 33 | 2017 |
| Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date X Chen, Y Liang, M Sterna, W Wang, J Błażewicz European Journal of Operational Research 284 (1), 67-74, 2020 | 32 | 2020 |
| Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect X Chen, V Chau, P Xie, M Sterna, J Błażewicz Computers & Industrial Engineering 111, 176-182, 2017 | 32 | 2017 |
| Total late work criteria for shop scheduling problems J Błażewicz, E Pesch, M Sterna, F Werner Operations Research Proceedings 1999: Selected Papers of the Symposium on …, 2000 | 32 | 2000 |
| A novel representation of graph structures in web mining and data analysis J Błażewicz, E Pesch, M Sterna Omega 33 (1), 65-71, 2005 | 30 | 2005 |
| Handbook on scheduling: From theory to practice J Błażewicz (No Title), 2019 | 27 | 2019 |
| Metaheuristics for late work minimization in two-machine flow shop with common due date J Blazewicz, E Pesch, M Sterna, F Werner KI 2005: Advances in Artificial Intelligence: 28th Annual German Conference …, 2005 | 24 | 2005 |
| Dominance relations for two-machine flow shop problem with late work criterion M Sterna Bulletin of the Polish Academy of Sciences Technical Sciences, 59-69-59-69, 2007 | 21 | 2007 |
