Malgorzata Sterna
Orcid: 0000-0002-3845-8194Affiliations:
- Poznań University of Technology, Poland
According to our database1,
Malgorzata Sterna
authored at least 23 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work.
Int. J. Appl. Math. Comput. Sci., 2024
2023
Int. J. Appl. Math. Comput. Sci., 2023
2022
Two-machine flow shop scheduling with a common due date to maximize total early work.
Eur. J. Oper. Res., 2022
Alternative algorithms for identical machines scheduling to maximize total early work with a common due date.
Comput. Ind. Eng., 2022
2021
Semi-online scheduling on two identical machines with a common due date to maximize total early work.
Discret. Appl. Math., 2021
2020
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date.
Eur. J. Oper. Res., 2020
Exact and heuristic algorithms for scheduling on two identical machines with early work maximization.
Comput. Ind. Eng., 2020
2017
Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work.
J. Optim. Theory Appl., 2017
Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers.
J. Optim. Theory Appl., 2017
Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect.
Comput. Ind. Eng., 2017
2016
Scheduling on parallel identical machines with late work criterion: Offline and online cases.
J. Sched., 2016
2015
Comput. Ind. Eng., 2015
2009
2008
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date.
Comput. Oper. Res., 2008
2007
J. Sched., 2007
Comput. Ind. Eng., 2007
2005
The two-machine flow-shop problem with weighted late work criterion and common due date.
Eur. J. Oper. Res., 2005
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion.
Comput. Ind. Eng., 2005
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date.
Proceedings of the KI 2005: Advances in Artificial Intelligence, 2005
2004
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004
2000
Eur. J. Oper. Res., 2000